Summary of block A002
Sequences in block A002
Section titled “Sequences in block A002”-
A002000: a(n+1) = a(n)*(a(n)^2 - 3) with a(0) = 7.
-
A002001: a(n) = 3*4^(n-1), n>0; a(0)=1.
-
A002011: a(n) = 4*(2n+1)!/n!^2.
-
A002015: a(n) = n^2 reduced mod 100.
-
A002023: a(n) = 6*4^n.
-
A002024: k appears k times; a(n) = floor(sqrt(2n) + 1/2).
-
A002042: a(n) = 7*4^n.
-
A002054: Binomial coefficient C(2n+1, n-1).
-
A002061: Central polygonal numbers: a(n) = n^2 - n + 1.
-
A002062: a(n) = Fibonacci(n) + n.
-
A002063: a(n) = 9*4^n.
-
A002064: Cullen numbers: a(n) = n*2^n + 1.
-
A002065: a(n+1) = a(n)^2 + a(n) + 1.
-
A002066: a(n) = 10*4^n.
-
A002081: Numbers congruent to {2, 4, 8, 16} (mod 20).
-
A002089: a(n) = 11*4^n.
-
A002097: Numbers that are not the sum of 3 nonzero triangular numbers.
-
A002104: Logarithmic numbers.
-
A002109: Hyperfactorials: Product_{k = 1..n} k^k.
-
A002203: Companion Pell numbers: a(n) = 2*a(n-1) + a(n-2), a(0) = a(1) = 2.
-
A002245: A (4,2)-sequence.
-
A002248: Number of points on y^2 + xy = x^3 + x^2 + x over GF(2^n).
-
A002249: a(n) = a(n-1) - 2*a(n-2) with a(0) = 2, a(1) = 1.
-
A002250: a(n) = 4^n - 2*3^n.
-
A002260: Triangle read by rows: T(n,k) = k for n >= 1, k = 1..n.
-
A002262: Triangle read by rows: T(n,k) = k, 0 <= k <= n, in which row n lists the first n+1 nonnegative integers.
-
A002264: Nonnegative integers repeated 3 times.
-
A002265: Nonnegative integers repeated 4 times.
-
A002266: Integers repeated 5 times.
-
A002268: Dimensions of integral lattices that are irreducible modulo every prime (there may be missing terms!).
-
A002270: Composite numbers k such that k*sigma(k) == 2 (mod phi(k)).
-
A002275: Repunits: (10^n - 1)/9. Often denoted by R_n.
-
A002276: a(n) = 2*(10^n - 1)/9.
-
A002277: a(n) = 3*(10^n - 1)/9.
-
A002278: a(n) = 4*(10^n - 1)/9.
-
A002279: a(n) = 5*(10^n - 1)/9.
-
A002280: a(n) = 6*(10^n - 1)/9.
-
A002281: a(n) = 7*(10^n - 1)/9.
-
A002282: a(n) = 8*(10^n - 1)/9.
-
A002283: a(n) = 10^n - 1.
-
A002299: Binomial coefficients C(2*n+5,5).
-
A002301: a(n) = n! / 3.
-
A002309: Sum of fourth powers of first n odd numbers.
-
A002310: a(n) = 5*a(n-1) - a(n-2), with a(0) = 1 and a(1) = 2.
-
A002315: NSW numbers: a(n) = 6*a(n-1) - a(n-2); also a(n)^2 - 2*b(n)^2 = -1 with b(n) = A001653(n+1).
-
A002320: a(n) = 5*a(n-1) - a(n-2).
-
A002378: Oblong (or promic, pronic, or heteromecic) numbers: a(n) = n*(n+1).
-
A002379: a(n) = floor(3^n / 2^n).
-
A002380: a(n) = 3^n reduced modulo 2^n.
-
A002393: Weight distribution of [8,4,4] Hamming code omitting 0 terms.
-
A002394: Weight distribution of [ 7,4,3 ] Hamming code.
-
A002395: a(n) is the number of crystal forms in n dimensions.
-
A002409: a(n) = 2^n*C(n+6,6). Number of 6D hypercubes in an (n+6)-dimensional hypercube.
-
A002411: Pentagonal pyramidal numbers: a(n) = n^2*(n+1)/2.
-
A002412: Hexagonal pyramidal numbers, or greengrocer’s numbers.
-
A002413: Heptagonal (or 7-gonal) pyramidal numbers: a(n) = n*(n+1)*(5*n-2)/6.
-
A002414: Octagonal pyramidal numbers: a(n) = n*(n+1)*(2*n-1)/2.
-
A002415: 4-dimensional pyramidal numbers: a(n) = n^2*(n^2-1)/12.
-
A002416: a(n) = 2^(n^2).
-
A002417: 4-dimensional figurate numbers: a(n) = n*binomial(n+2, 3).
-
A002419: 4-dimensional figurate numbers: a(n) = (6*n-2)*binomial(n+2,3)/4.
-
A002420: Expansion of sqrt(1 - 4*x) in powers of x.
-
A002421: Expansion of (1-4*x)^(3/2) in powers of x.
-
A002446: a(n) = 2^(2*n+1) - 2.
-
A002450: a(n) = (4^n - 1)/3.
-
A002451: Expansion of 1/((1-x)*(1-4*x)*(1-9*x)).
-
A002452: a(n) = (9^n - 1)/8.
-
A002454: Central factorial numbers: a(n) = 4^n * (n!)^2.
-
A002456: Joffe’s central differences of 0, A241171(n,n-1).
-
A002457: a(n) = (2n+1)!/n!^2.
-
A002458: a(n) = binomial(4*n+1, 2*n).
-
A002467: The game of Mousetrap with n cards (given n letters and n envelopes, how many ways are there to fill the envelopes so that at least one letter goes into its right envelope?).
-
A002474: Denominators of coefficients of odd powers of x of the expansion of Bessel function J_1(x).
-
A002477: Wonderful Demlo numbers: a(n) = ((10^n - 1)/9)^2.
-
A002478: Bisection of A000930.
-
A002489: a(n) = n^(n^2), or (n^n)^n.
-
A002492: Sum of the first n even squares: 2*n*(n+1)*(2*n+1)/3.
-
A002506: Denominators of coefficients of expansion of Bessel function J_2(x).
-
A002522: a(n) = n^2 + 1.
-
A002523: a(n) = n^4 + 1.
-
A002532: a(n) = 2*a(n-1) + 5*a(n-2), a(0) = 0, a(1) = 1.
-
A002533: a(n) = 2*a(n-1) + 5*a(n-2), with a(0) = a(1) = 1.
-
A002534: a(n) = 2*a(n-1) + 9*a(n-2), with a(0) = 0, a(1) = 1.
-
A002535: a(n) = 2*a(n-1) + 9*a(n-2), with a(0)=a(1)=1.
-
A002542: Number of two-valued complete Post functions of n variables.
-
A002544: a(n) = binomial(2*n+1,n)*(n+1)^2.
-
A002578: Number of integral points in a certain sequence of open quadrilaterals.
-
A002579: Number of integral points in a certain sequence of closed quadrilaterals.
-
A002593: a(n) = n^2*(2*n^2 - 1); also Sum_{k=0..n-1} (2k+1)^3.
-
A002594: a(n) = n^2*(16*n^4-20*n^2+7)/3.
-
A002604: a(n) = n^6 + 1.
-
A002605: a(n) = 2*(a(n-1) + a(n-2)), a(0) = 0, a(1) = 1.
-
A002620: Quarter-squares: a(n) = floor(n/2)*ceiling(n/2). Equivalently, a(n) = floor(n^2/4).
-
A002623: Expansion of 1/((1-x)^4*(1+x)).
-
A002627: a(n) = n*a(n-1) + 1, a(0) = 0.
-
A002631: Number of circuits of nullity n.
-
A002662: a(n) = 2^n - 1 - n*(n+1)/2.
-
A002663: a(n) = 2^n - C(n,0) - C(n,1) - C(n,2) - C(n,3).
-
A002671: a(n) = 4^n*(2*n+1)!.
-
A002674: a(n) = (2n)!/2.
-
A002690: a(n) = (n+1) * (2*n)! / n!.
-
A002691: a(n) = (n+2) * (2n+1) * (2n-1)! / (n-1)!.
-
A002697: a(n) = n*4^(n-1).
-
A002698: Coefficients of Chebyshev polynomials: n*(2*n-3)*2^(2*n-5).
-
A002699: a(n) = n*2^(2*n-1).
-
A002700: Coefficients of Chebyshev polynomials: n*(2*n+1) * 4^(n-1).
-
A002708: a(n) = Fibonacci(n) mod n.
-
A002717: a(n) = floor(n(n+2)(2n+1)/8).
-
A002726: a(n) = Fibonacci(n+1) mod n.
-
A002736: Apéry numbers: a(n) = n^2*C(2n,n).
-
A002738: Coefficients for extrapolation.
-
A002752: a(n) = Fibonacci(n-1) mod n.
-
A002754: Related to coefficient of m in Jacobi elliptic function cn(z, m).
-
A002775: a(n) = n^2 * n!.
-
A002776: Terms in certain determinants.
-
A002783: a(n) = 2*(3^n - 2^n) + 1.
-
A002789: Number of integer points in a certain quadrilateral scaled by a factor of n.
-
A002798: a(n) = a(n-1) + a(n-2) - a(n-3).
-
A002802: a(n) = (2*n+3)!/(6*n!*(n+1)!).
-
A002803: a(n) = (2n+4)!/(4!*n!*(n+1)!).
-
A002804: (Presumed) solution to Waring’s problem: g(n) = 2^n + floor((3/2)^n) - 2.
-
A002812: a(n) = 2*a(n-1)^2 - 1, starting a(0) = 2.
-
A002813: a(0) = 4; for n > 0, a(n) = a(n-1)^3 - 3*a(n-1)^2 + 3.
-
A002817: Doubly triangular numbers: a(n) = n*(n+1)*(n^2+n+2)/8.
-
A002866: a(0) = 1; for n > 0, a(n) = 2^(n-1)*n!.
-
A002867: a(n) = binomial(n,floor(n/2))*(n+1)!.
-
A002878: Bisection of Lucas sequence: a(n) = L(2*n+1).
-
A002884: Number of nonsingular n X n matrices over GF(2) (order of the group GL(n,2)); order of Chevalley group A_n (2); order of projective special linear group PSL_n(2).
-
A002887: The minimum number of nodes of a tree with a cutting center of n nodes.
-
A002894: a(n) = binomial(2n, n)^2.
-
A002901: n^3 - floor( n/3 ).
-
A002939: a(n) = 2*n*(2*n-1).
-
A002943: a(n) = 2*n*(2*n+1).
-
A002999: Expansion of (1 + x*exp(x))^2.