Summary of block A006
Sequences in block A006
Section titled “Sequences in block A006”-
A006000: a(n) = (n+1)*(n^2+n+2)/2; g.f.: (1 + 2*x^2) / (1 - x)^4.
-
A006001: Number of paraffins.
-
A006002: a(n) = n*(n+1)^2/2.
-
A006003: a(n) = n*(n^2 + 1)/2.
-
A006004: a(n) = C(n+2,3) + C(n,3) + C(n-1,3).
-
A006007: 4-dimensional analog of centered polygonal numbers: a(n) = n(n+1)*(n^2+n+4)/12.
-
A006008: Number of inequivalent ways to color vertices of a regular tetrahedron using <= n colors.
-
A006009: Number of paraffins.
-
A006011: a(n) = n^2*(n^2 - 1)/4.
-
A006012: a(0) = 1, a(1) = 2, a(n) = 4*a(n-1) - 2*a(n-2), n >= 2.
-
A006040: a(n) = Sum_{i=0..n} (n!/(n-i)!)^2.
-
A006041: a(n+1) = (n^2 - 1)*a(n) + n + 1.
-
A006043: A traffic light problem: expansion of 2/(1 - 3*x)^3.
-
A006044: a(n) = 4^(n-4)*(n-1)*(n-2)*(n-3).
-
A006051: Square hex numbers.
-
A006061: Star numbers (A003154) that are squares.
-
A006062: Star-hex numbers.
-
A006066: Kobon triangles: maximal number of nonoverlapping triangles that can be formed from n lines drawn in the plane.
-
A006088: a(n) = (2^n + 2) a(n-1) (kissing number of Barnes-Wall lattice in dimension 2^n).
-
A006091: a(n) = n^n - n + 1.
-
A006095: Gaussian binomial coefficient [n, 2] for q = 2.
-
A006100: Gaussian binomial coefficient [n, 2] for q = 3.
-
A006105: Gaussian binomial coefficient [ n,2 ] for q=4.
-
A006111: Gaussian binomial coefficient [ n,2 ] for q=5.
-
A006123: Erroneous version of A000085.
-
A006124: a(n) = 3 + n/2 + 7*n^2/2.
-
A006125: a(n) = 2^(n*(n-1)/2).
-
A006127: a(n) = 2^n + n.
-
A006130: a(n) = a(n-1) + 3*a(n-2) for n > 1, a(0) = a(1) = 1.
-
A006131: a(n) = a(n-1) + 4*a(n-2), a(0) = a(1) = 1.
-
A006134: a(n) = Sum_{k=0..n} binomial(2*k,k).
-
A006137: a(n) = 1 + n/2 + 9*n^2/2.
-
A006138: a(n) = a(n-1) + 3*a(n-2).
-
A006157: a(n+1) = (n-1)*a(n) + n*n!.
-
A006172: a(n) = 1 + F(2*n+1) + (-1)^n*L(n).
-
A006186: Number of pair-coverings with largest block size 4.
-
A006187: Number of pair-coverings with largest block size 5.
-
A006188: Maximal cycles in trivalent graphs.
-
A006190: a(n) = 3*a(n-1) + a(n-2), with a(0)=0, a(1)=1.
-
A006191: Number of paths on square lattice.
-
A006221: From Apery continued fraction for zeta(3): zeta(3)=6/(5-1^6/(117-2^6/(535-3^6/(1463…)))).
-
A006222: 11*n^2 + 11*n + 3.
-
A006231: a(n) = Sum_{k=2..n} n(n-1)…(n-k+1)/k.
-
A006234: a(n) = n*3^(n-4).
-
A006235: Complexity of doubled cycle (regarding case n = 2 as a multigraph).
-
A006242: Extracting a square root.
-
A006244: Hexagonal numbers (A000384) which are also centered hexagonal numbers (A003215).
-
A006250: Number of hypertournaments on n elements under signed bijection.
-
A006253: Number of perfect matchings (or domino tilings) in C_4 X P_n.
-
A006257: Josephus problem: a(2*n) = 2*a(n)-1, a(2*n+1) = 2*a(n)+1.
-
A006263: Erroneous version of A014221.
-
A006266: A continued cotangent.
-
A006267: Continued cotangent for the golden ratio.
-
A006268: A continued cotangent.
-
A006269: A continued cotangent.
-
A006277: a(n) = (a(n-1) + 1)*a(n-2).
-
A006279: Denominators of convergents to Cahen’s constant: a(n+2) = a(n)^2*a(n+1) + a(n).
-
A006324: a(n) = n*(n + 1)*(2*n^2 + 2*n - 1)/6.
-
A006325: 4-dimensional analog of centered polygonal numbers.
-
A006327: a(n) = Fibonacci(n) - 3. Number of total preorders.
-
A006331: a(n) = n*(n+1)*(2*n+1)/3.
-
A006335: a(n) = 4^n*(3*n)!/((n+1)!*(2*n+1)!).
-
A006342: Coloring a circuit with 4 colors.
-
A006347: a(n) = (n+1) a(n-1) + (-1)^n.
-
A006348: a(n) = (n+2)*a(n-1) + (-1)^n.
-
A006355: Number of binary vectors of length n containing no singletons.
-
A006356: a(n) = 2*a(n-1) + a(n-2) - a(n-3) for n >= 3, starting with a(0) = 1, a(1) = 3, and a(2) = 6.
-
A006364: Numbers k with an even number of 1’s in binary, ignoring last bit.
-
A006368: The “amusical permutation” of the nonnegative numbers: a(2n)=3n, a(4n+1)=3n+1, a(4n-1)=3n-1.
-
A006370: The Collatz or 3x+1 map: a(n) = n/2 if n is even, 3n + 1 if n is odd.
-
A006373: Numbers of terms in expressions for coefficients of Euler-Lagrange tensors in terms of Riemann-Christoffel curvature tensor and two of its contractions (viz., the Ricci curvature tensor and the Riemann curvature scalar) for n-dimensional differentiable manifolds having a general linear connection.
-
A006411: Number of nonseparable tree-rooted planar maps with n + 2 edges and 3 vertices.
-
A006414: Number of nonseparable toroidal tree-rooted maps with n + 2 edges and n + 1 vertices.
-
A006416: Number of loopless rooted planar maps with 3 faces and n vertices and no isthmuses. Also a(n)=T(4,n-3), array T as in A049600.
-
A006470: Number of tree-rooted planar maps with 3 faces and n vertices and no isthmuses.
-
A006472: a(n) = n!*(n-1)!/2^(n-1).
-
A006480: De Bruijn’s S(3,n): (3n)!/(n!)^3.
-
A006483: a(n) = Fibonacci(n)*2^n + 1.
-
A006484: a(n) = n*(n + 1)*(n^2 - 3*n + 5)/6.
-
A006485: a(n) = (2^(2^n + 1) + 1)/3.
-
A006490: a(1) = 1, a(2) = 0; for n > 2, a(n) = n*Fibonacci(n-2) (with the convention Fibonacci(0)=0, Fibonacci(1)=1).
-
A006495: Real part of (1 + 2*i)^n, where i is sqrt(-1).
-
A006496: Imaginary part of (1+2i)^n.
-
A006497: a(n) = 3*a(n-1) + a(n-2) with a(0) = 2, a(1) = 3.
-
A006498: a(n) = a(n-1) + a(n-3) + a(n-4), a(0) = a(1) = a(2) = 1, a(3) = 2.
-
A006503: a(n) = n*(n+1)*(n+8)/6.
-
A006516: a(n) = 2^(n-1)*(2^n - 1), n >= 0.
-
A006519: Highest power of 2 dividing n.
-
A006523: Sum ((-1)^(i+1)*binomial(n,i)*2^i*(2*n-1)!,i=1..n) for n odd.
-
A006527: a(n) = (n^3 + 2*n)/3.
-
A006528: a(n) = (n^4 + n^2 + 2*n)/4.
-
A006545: Number of stable unicyclic graphs with n nodes.
-
A006548: (2*n)!-Sum ((-1)^(i+1)*binomial(n,i)*2^i*(2*n-1)!,i=1..n).
-
A006564: Icosahedral numbers: a(n) = n*(5*n^2 - 5*n + 2)/2.
-
A006565: Number of ways to color vertices of a hexagon using <= n colors, allowing only rotations.
-
A006566: Dodecahedral numbers: a(n) = n*(3*n - 1)*(3*n - 2)/2.
-
A006574: Number of domino n-tuples.
-
A006578: Triangular numbers plus quarter squares: n*(n+1)/2 + floor(n^2/4) (i.e., A000217(n) + A002620(n)).
-
A006584: If n mod 2 = 0 then n*(n^2-4)/12 else n*(n^2-1)/12.
-
A006587: a(n) = 3*2^(2*n)*(3*n)!/((2*n)!*n!).
-
A006588: a(n) = 4^n*(3*n)!/((2*n)!*n!).
-
A006592: a(n) = 10*n^3 - 6*n^2.
-
A006594: A Beatty sequence: floor(n*(1 + 1/e)).
-
A006595: a(n) = (n+2)!/4 + n!/2.
-
A006597: a(n) = n^2*(5*n-3)/2.
-
A006619: Zarankiewicz’s problem.
-
A006624: a(n) is the least k such that every n X (n+3) {0,1}-matrix with k ones contains an all-ones 2 X 4 submatrix.
-
A006625: A variant of Zarankiewicz’s problem: a(n) is the least k such that every n X (n+2) {0,1}-matrix with k ones contains an all-ones 3 X 4 submatrix.
-
A006640: Restricted postage stamp problem.
-
A006646: Exponential self-convolution of Pell numbers.
-
A006652: From the graph reconstruction problem.
-
A006668: Exponential self-convolution of Pell numbers (divided by 2).
-
A006671: Edge-distinguishing chromatic number of cycle with n nodes.
-
A006672: a(n) = smallest m such that for every red-blue edge-coloring of the graph K_{m} there exists either a red 4-cycle or a blue K_{1,n}; Ramsey number r(C_4, K_{1,n}).
-
A006675: Number of paths through an array.
-
A006684: Convolve Fibonacci and Pell numbers.
-
A006788: a(n) = floor(2^(n-1)/n).
-
A006882: Double factorials n!!: a(n) = n*a(n-2) for n > 1, a(0) = a(1) = 1.
-
A006892: Representation as a sum of squares requires n squares with greedy algorithm.
-
A006893: Smallest number whose representation requires n triangular numbers with greedy algorithm; also number of 1-2 rooted trees of height n.
-
A006894: Number of planted 3-trees of height < n.
-
A006904: a(n) = a(n-1) + 2*a(n-2) + (-1)^n.
-
A006918: a(n) = binomial(n+3, 3)/4 for odd n, n*(n+2)*(n+4)/24 for even n.
-
A006963: Number of planar embedded labeled trees with n nodes: (2*n-3)!/(n-1)! for n >= 2, a(1) = 1.
-
A006985: Fibonacci tower: a(n) = F(a(n-1)+2) (there is no room for next term).
-
A006996: a(n) = C(2n,n) mod 3.
-
A006999: Partitioning integers to avoid arithmetic progressions of length 3.