Summary of block A007
Sequences in block A007
Section titled “Sequences in block A007”-
A007004: a(n) = (3*n)! / ((n+1)*(n!)^3).
-
A007013: Catalan-Mersenne numbers: a(0) = 2; for n >= 0, a(n+1) = 2^a(n) - 1.
-
A007018: a(n) = a(n-1)^2 + a(n-1), a(0)=1.
-
A007019: a(n) = (2n+1)! / 2^n.
-
A007039: Number of cyclic binary n-bit strings with no alternating substring of length > 2.
-
A007051: a(n) = (3^n + 1)/2.
-
A007052: Number of order-consecutive partitions of n.
-
A007054: Super ballot numbers: 6(2n)!/(n!(n+2)!).
-
A007064: Numbers not of form “nearest integer to n*tau”, tau = (1+sqrt(5))/2.
-
A007066: a(n) = 1 + ceiling((n-1)*phi^2), phi = (1+sqrt(5))/2.
-
A007068: a(n) = a(n-1) + (3+(-1)^n)*a(n-2)/2.
-
A007070: a(n) = 4*a(n-1) - 2*a(n-2) with a(0) = 1, a(1) = 4.
-
A007073: First column of array associated with lexicographically justified array.
-
A007179: Dual pairs of integrals arising from reflection coefficients.
-
A007202: Crystal ball sequence for hexagonal close-packing.
-
A007204: Crystal ball sequence for D_4 lattice.
-
A007226: a(n) = 2*det(M(n; -1))/det(M(n; 0)), where M(n; m) is the n X n matrix with (i,j)-th element equal to 1/binomial(n + i + j + m, n).
-
A007238: Length of longest chain of subgroups in S_n.
-
A007283: a(n) = 3*2^n.
-
A007290: a(n) = 2*binomial(n,3).
-
A007310: Numbers congruent to 1 or 5 mod 6.
-
A007318: Pascal’s triangle read by rows: C(n,k) = binomial(n,k) = n!/(k!*(n-k)!), 0 <= k <= n.
-
A007334: Number of spanning trees in the graph K_{n}/e, which results from contracting an edge e in the complete graph K_{n} on n vertices (for n>=2).
-
A007339: a(n) = n! - n^3.
-
A007362: Denominator of n-th power of Hermite constant for dimension n.
-
A007364: Maximal tight voting schemes on n points.
-
A007382: Number of strict (-1)st-order maximal independent sets in path graph.
-
A007395: Constant sequence: the all 2’s sequence.
-
A007401: Add n-1 to n-th term of ‘n appears n times’ sequence (A002024).
-
A007466: Exponential-convolution of natural numbers with themselves.
-
A007478: Dimension of primitive Vassiliev knot invariants of order n.
-
A007482: a(n) is the number of subsequences of [ 1, …, 2n ] in which each odd number has an even neighbor.
-
A007483: a(n) = 3*a(n-1) + 2*a(n-2), with a(0)=1, a(1)=5.
-
A007484: a(n) = 3*a(n-1) + 2*a(n-2), with a(0)=2, a(1)=7.
-
A007487: Sum of 9th powers.
-
A007489: a(n) = Sum_{k=1..n} k!.
-
A007492: Fibonacci(n) - (-1)^n.
-
A007494: Numbers that are congruent to 0 or 2 mod 3.
-
A007501: a(0) = 2; for n >= 0, a(n+1) = a(n)*(a(n)+1)/2.
-
A007502: Les Marvin sequence: a(n) = F(n)+(n-1)*F(n-1), F() = Fibonacci numbers.
-
A007516: (2^2^…^2) (n times) + 1.
-
A007518: a(n) = floor(n*(n+2)*(2*n-1)/8).
-
A007526: a(n) = n*(a(n-1) + 1), a(0) = 0.
-
A007531: a(n) = n*(n-1)*(n-2) (or n!/(n-3)!).
-
A007533: a(n) = (5*n + 1)^2 + 4*n + 1.
-
A007540: Wilson primes: primes p such that (p-1)! == -1 (mod p^2).
-
A007559: Triple factorial numbers (3*n-2)!!! with leading 1 added.
-
A007566: a(n+1) = (2n+3)*a(n) - 2n*a(n-1) + 8n, a(0) = 1, a(1) = 3.
-
A007570: a(n) = F(F(n)), where F is a Fibonacci number.
-
A007572: Generalization of the golden ratio (expansion of (5-13x)/((1+x)(1-4x))).
-
A007574: Patterns in a dual ring.
-
A007581: a(n) = (2^n+1)*(2^n+2)/6.
-
A007582: a(n) = 2^(n-1)*(1+2^n).
-
A007583: a(n) = (2^(2*n + 1) + 1)/3.
-
A007584: 9-gonal (or enneagonal) pyramidal numbers: a(n) = n*(n+1)*(7*n-4)/6.
-
A007585: 10-gonal (or decagonal) pyramidal numbers: a(n) = n*(n + 1)*(8*n - 5)/6.
-
A007586: 11-gonal (or hendecagonal) pyramidal numbers: a(n) = n*(n+1)*(3*n-2)/2.
-
A007588: Stella octangula numbers: a(n) = n*(2*n^2 - 1).
-
A007590: a(n) = floor(n^2/2).
-
A007598: Squared Fibonacci numbers: a(n) = F(n)^2 where F = A000045.
-
A007611: a(n) = n! + 2^n.
-
A007612: a(n+1) = a(n) + digital root (A010888) of a(n).
-
A007613: a(n) = (8^n + 2*(-1)^n)/3.
-
A007654: Numbers k such that the standard deviation of 1,…,k is an integer.
-
A007655: Standard deviation of A007654.
-
A007660: a(n) = a(n-1)*a(n-2) + 1 with a(0) = a(1) = 0.
-
A007667: The sum of both two and three consecutive squares.
-
A007673: Number of coins needed for ApSimon’s mints problem.
-
A007679: If n mod 4 = 0 then 2^(n-1)+1 elif n mod 4 = 2 then 2^(n-1)-1 else 2^(n-1).
-
A007680: a(n) = (2n+1)*n!.
-
A007681: a(n) = (2*n+1)^2*n!.
-
A007685: a(n) = Product_{k=1..n} binomial(2*k,k).
-
A007689: a(n) = 2^n + 3^n.
-
A007696: Quartic (or 4-fold) factorial numbers: a(n) = Product_{k = 0..n-1} (4*k + 1).
-
A007704: a(n+2) = (a(n) - 1)*a(n+1) + 1.
-
A007742: a(n) = n*(4*n+1).
-
A007744: Expansion of (1+6*x)/(1-4*x)^(7/2).
-
A007751: Even bisection of A007750.
-
A007752: Odd bisection of A007750.
-
A007758: a(n) = 2^n*n^2.
-
A007759: Knopfmacher expansion of sqrt(2): a(2n) = 2*(a(2n-1) + 1)^2 - 1, a(2n+1) = 2*(a(2n)^2 - 1).
-
A007778: a(n) = n^(n+1).
-
A007781: a(n) = (n+1)^(n+1) - n^n for n>0, a(0) = 1.
-
A007798: Expected number of random moves in Tower of Hanoi problem with n disks starting with a randomly chosen position and ending at a position with all disks on the same peg.
-
A007800: From a problem in AI planning: a(n) = 4+a(n-1)+a(n-2)+a(n-3)+a(n-4)-a(n-5)-a(n-6)-a(n-7), n>7.
-
A007805: a(n) = Fibonacci(6*n + 3)/2.
-
A007807: A variation on Euclid: a(n)=g(n)-1, where g(0)=0, g(1)=1, g(n+1)=g(n)(g(n-1)+1).
-
A007808: Number of directed column-convex polyominoes of height n: a(k+1)=(k+1)*a(k)+(a(1)+…+a(k)).
-
A007830: a(n) = (n+3)^n.
-
A007876: a(2n-1) = n*a(2n-2), a(2n) = n*a(2n-1) + 1.
-
A007877: Period 4 zigzag sequence: repeat [0,1,2,1].
-
A007881: Erroneous version of A001357 printed by mistake on back cover of Encyclopedia of Integer Sequences.
-
A007887: a(n) = Fibonacci(n) mod 9.
-
A007899: Coordination sequence for hexagonal close-packing.
-
A007900: Coordination sequence for D_4 lattice.
-
A007904: Crystal ball sequence for diamond.
-
A007909: Expansion of (1-x)/(1-2*x+x^2-2*x^3).
-
A007910: Expansion of 1/((1-2*x)*(1+x^2)).
-
A007929: Odd numbers containing an even digit.
-
A007945: Expansion of g.f. (2-x-2*x^2)/((1-x)*(1-x+x^2)).
-
A007972: Number of permutations that are 2 “block reversals” away from 12…n.
-
A007977: Modified de Bruijn sequences: max. length of binary necklace in which no n-bit word appears twice.
-
A007978: Least non-divisor of n.
-
A007979: Expansion of (1+x^2)(1+x^4)/((1-x)^2*(1-x^2)*(1-x^3)).
-
A007980: Expansion of (1+x^2)/((1-x)^2*(1-x^3)).
-
A007997: a(n) = ceiling((n-3)(n-4)/6).