Skip to content

Summary of block A104

49 sequences
  • A104004: Expansion of (1-x) * (1+x) / ((1-2*x)*(1-x-x^2)).

  • A104005: a(n+3) = a(n+2) + 3a(n+1) - 2a(n); a(0) = 1, a(1) = -1, a(2)= 3.

  • A104099: a(n) = n * (10*n^2 - 6n + 1) = n * A087348(n).

  • A104104: a(1) = 1, if A(k) = sequence of first 2^(k-1) terms and if B(k) is A(k) with 0’s and 1’s exchanged, then A(k+1) = A(k)A(k) if a(k) = 0, A(k+1) = A(k)B(k) if a(k) = 1.

  • A104121: a(n)=1 if there is a partition of n^3 into n primes such that n-1 are consecutive primes and the remaining prime is larger than the sum of the n-1 consecutive primes, otherwise a(0)=0 if no such partition exists.

  • A104150: Shifted factorial numbers: a(0)=0, a(n) = (n-1)!.

  • A104161: G.f.: x*(1 - x + x^2)/((1-x)^2 * (1 - x - x^2)).

  • A104188: a(n) = 4*n*(4*n - 1).

  • A104218: Sum of opposite numbers on a clock, starting at 12.

  • A104220: a(n) = 1 + Fibonacci(n) - (Fibonacci(n) mod 2).

  • A104221: a(n) = Fibonacci(n) - (Fibonacci(n) mod 2).

  • A104249: a(n) = (3*n^2 + n + 2)/2.

  • A104255: a(n) = floor( (2n-1)!!/(2n) ).

  • A104256: [ (2n-1)!!/(4n) ].

  • A104270: a(n) = 2^(n - 2)*(binomial(n,2) + 2).

  • A104340: Numbers n such that (digital reversal of n) - n = 9.

  • A104341: Numbers n such that n -(digital reversal of n) = 9.

  • A104342: Numbers n such that (digital reversal of n) - n = 18.

  • A104344: a(n) = Sum_{k=1..n} k!^2.

  • A104373: Numbers m such that (A104350(m)-1, A104350(m)+1) is a twin prime pair.

  • A104435: Number of ways to split 1, 2, 3, …, 2n into 2 arithmetic progressions each with n terms.

  • A104449: Fibonacci sequence with initial values a(0) = 3 and a(1) = 1.

  • A104462: Convert the binary strings in A101305 to decimal.

  • A104473: a(n) = binomial(n+2,2)*binomial(n+6,2).

  • A104487: a(n+3) = 6a(n+2) - 10a(n+1) + 3a(n); a(0) = 1, a(1) = 4, a(2) = 14.

  • A104521: Fixed point of the morphism 0->{1}, 1->{1,0,1}.

  • A104522: Expansion of (-1+x+3*x^2-x^3)/((x+1)(3*x-1)(x-1)^2).

  • A104537: Expansion of g.f. (1+x)/(1+2*x+4*x^2).

  • A104538: Expansion of g.f. (1 + 2*x) / (1 + 2*x + 4*x^2).

  • A104563: A floretion-generated sequence relating to centered square numbers.

  • A104581: Expansion of g.f. 1/(1 + x + x^3 + x^4).

  • A104584: a(n) = (1/2) * ( 3*n^2 + n*(-1)^n ).

  • A104585: a(n) = (1/2) * ( 3*n^2 - n*(-1)^n ).

  • A104643: Number of arrangements that can be formed by taking n distinct things out of 25.

  • A104650: Numbers of primes n needed to sum to semiprime without multiplicity.

  • A104661: Duplicate of A020725.

  • A104675: a(n) = C(n+1,n) * C(n+6,1).

  • A104683: Interlaces “2*n^2 - 1 is a square” with NSW numbers.

  • A104686: a(n) = n*(n+1)/2 (mod 6).

  • A104720: Expansion of 1/((1-x)(1-x^2)(1-10x)).

  • A104721: Expansion of (1+x)^2/(1-4*x^2).

  • A104743: a(n) = 3^n + n.

  • A104745: a(n) = 5^n + n.

  • A104747: a(n) = (n-3)*2^n + n*(n+3)/2 + 3.

  • A104777: Integer squares congruent to 1 mod 6.

  • A104891: a(0) = 0; a(n) = 5*a(n-1) + 5.

  • A104896: a(0) = 0; a(n) = 7*a(n-1) + 7.

  • A104905: Numbers m such that d(m)*phi(m) = sigma(m), where d(m) is number of positive divisors of m.

  • A104934: Expansion of (1-x)/(1 - 3*x - 2*x^2).