Skip to content

Summary of block A000

162 sequences
  • A000001: Number of groups of order n.

  • A000004: The zero sequence.

  • A000005: d(n) (also called tau(n) or sigma_0(n)), the number of divisors of n.

  • A000007: The characteristic function of {0}: a(n) = 0^n.

  • A000010: Euler totient function phi(n): count numbers <= n and prime to n.

  • A000012: The simplest sequence of positive numbers: the all 1’s sequence.

  • A000023: Expansion of e.g.f. exp(-2*x)/(1-x).

  • A000027: The positive integers. Also called the natural numbers, the whole numbers or the counting numbers, but these terms are ambiguous.

  • A000032: Lucas numbers beginning at 2: L(n) = L(n-1) + L(n-2), L(0) = 2, L(1) = 1.

  • A000034: Period 2: repeat [1, 2]; a(n) = 1 + (n mod 2).

  • A000035: Period 2: repeat [0, 1]; a(n) = n mod 2; parity of n.

  • A000037: Numbers that are not squares (or, the nonsquares).

  • A000038: Twice A000007.

  • A000040: The prime numbers.

  • A000041: a(n) is the number of partitions of n (the partition numbers).

  • A000042: Unary representation of natural numbers.

  • A000043: Mersenne exponents: primes p such that 2^p - 1 is prime. Then 2^p - 1 is called a Mersenne prime.

  • A000045: Fibonacci numbers: F(n) = F(n-1) + F(n-2) with F(0) = 0 and F(1) = 1.

  • A000051: a(n) = 2^n + 1.

  • A000058: Sylvester’s sequence: a(n+1) = a(n)^2 - a(n) + 1, with a(0) = 2.

  • A000069: Odious numbers: numbers with an odd number of 1’s in their binary expansion.

  • A000071: a(n) = Fibonacci(n) - 1.

  • A000079: Powers of 2: a(n) = 2^n.

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

  • A000108: Catalan numbers: C(n) = binomial(2n,n)/(n+1) = (2n)!/(n!(n+1)!).

  • A000115: Denumerants: Expansion of 1/((1-x)*(1-x^2)*(1-x^5)).

  • A000120: 1’s-counting sequence: number of 1’s in binary expansion of n (or the binary weight of n).

  • A000124: Central polygonal numbers (the Lazy Caterer’s sequence): n(n+1)/2 + 1; or, maximal number of pieces formed when slicing a pancake with n cuts.

  • A000125: Cake numbers: maximal number of pieces resulting from n planar cuts through a cube (or cake): C(n+1,3) + n + 1.

  • A000126: A nonlinear binomial sum.

  • A000127: Maximal number of regions obtained by joining n points around a circle by straight lines. Also number of regions in 4-space formed by n-1 hyperplanes.

  • A000128: A nonlinear binomial sum.

  • A000129: Pell numbers: a(0) = 0, a(1) = 1; for n > 1, a(n) = 2*a(n-1) + a(n-2).

  • A000139: a(n) = 2*(3*n)! / ((2*n+1)!*(n+1)!).

  • A000142: Factorial numbers: n! = 1*2*3*4*…*n (order of symmetric group S_n, number of permutations of n letters).

  • A000165: Double factorial of even numbers: (2n)!! = 2^n*n!.

  • A000166: Subfactorial or rencontres numbers, or derangements: number of permutations of n elements with no fixed points.

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

  • A000169: Number of labeled rooted trees with n nodes: n^(n-1).

  • A000178: Superfactorials: product of first n factorials.

  • A000180: Expansion of E.g.f. exp(-x)/(1-3x).

  • A000194: n appears 2n times, for n >= 1; also nearest integer to square root of n.

  • A000196: Integer part of square root of n. Or, number of positive squares <= n. Or, n appears 2n+1 times.

  • A000197: a(n) = (n!)!.

  • A000201: Lower Wythoff sequence (a Beatty sequence): a(n) = floor(n*phi), where phi = (1+sqrt(5))/2 = A001622.

  • A000202: a(8i+j) = 13i + a(j), where 1<=j<=8.

  • A000204: Lucas numbers (beginning with 1): L(n) = L(n-1) + L(n-2) with L(1) = 1, L(2) = 3.

  • A000210: A Beatty sequence: floor(n*(e-1)).

  • A000211: a(n) = a(n-1) + a(n-2) - 2, a(0) = 4, a(1) = 3.

  • A000212: a(n) = floor(n^2/3).

  • A000215: Fermat numbers: a(n) = 2^(2^n) + 1.

  • A000217: Triangular numbers: a(n) = binomial(n+1,2) = n*(n+1)/2 = 0 + 1 + 2 + … + n.

  • A000225: a(n) = 2^n - 1. (Sometimes called Mersenne numbers, although that name is usually reserved for A001348.)

  • A000240: Rencontres numbers: number of permutations of [n] with exactly one fixed point.

  • A000244: Powers of 3: a(n) = 3^n.

  • A000245: a(n) = 3*(2*n)!/((n+2)!*(n-1)!).

  • A000246: Number of permutations in the symmetric group S_n that have odd order.

  • A000247: a(n) = 2^n - n - 2.

  • A000254: Unsigned Stirling numbers of first kind, s(n+1,2): a(n+1) = (n+1)*a(n) + n!.

  • A000255: a(n) = n*a(n-1) + (n-1)*a(n-2), a(0) = 1, a(1) = 1.

  • A000257: Number of rooted bicubic maps: a(n) = (8*n-4)*a(n-1)/(n+2) for n >= 2, a(0) = a(1) = 1.

  • A000265: Remove all factors of 2 from n; or largest odd divisor of n; or odd part of n.

  • A000267: Integer part of square root of 4n+1.

  • A000272: Number of trees on n labeled nodes: n^(n-2) with a(0)=1.

  • A000274: Number of permutations of length n with 2 consecutive ascending pairs.

  • A000278: a(n) = a(n-1) + a(n-2)^2 for n >= 2 with a(0) = 0 and a(1) = 1.

  • A000280: a(n) = a(n-1) + a(n-2)^3.

  • A000283: a(n) = a(n-1)^2 + a(n-2)^2 for n >= 2 with a(0) = 0 and a(1) = 1.

  • A000284: a(n) = a(n-1)^3 + a(n-2) with a(0)=0, a(1)=1.

  • A000285: a(0) = 1, a(1) = 4, and a(n) = a(n-1) + a(n-2) for n >= 2.

  • A000289: A nonlinear recurrence: a(n) = a(n-1)^2 - 3*a(n-1) + 3 (for n>1).

  • A000290: The squares: a(n) = n^2.

  • A000292: Tetrahedral (or triangular pyramidal) numbers: a(n) = C(n+2,3) = n*(n+1)*(n+2)/6.

  • A000295: Eulerian numbers (Euler’s triangle: column k=2 of A008292, column k=1 of A173018).

  • A000301: a(n) = a(n-1)*a(n-2) with a(0) = 1, a(1) = 2; also a(n) = 2^Fibonacci(n).

  • A000302: Powers of 4: a(n) = 4^n.

  • A000304: a(n) = a(n-1)*a(n-2).

  • A000309: Number of rooted planar bridgeless cubic maps with 2n nodes.

  • A000312: a(n) = n^n; number of labeled mappings from n points to themselves (endofunctions).

  • A000324: A nonlinear recurrence: a(0) = 1, a(1) = 5, a(n) = a(n-1)^2 - 4*a(n-1) + 4 for n>1.

  • A000325: a(n) = 2^n - n.

  • A000326: Pentagonal numbers: a(n) = n*(3*n-1)/2.

  • A000330: Square pyramidal numbers: a(n) = 0^2 + 1^2 + 2^2 + … + n^2 = n*(n+1)*(2*n+1)/6.

  • A000332: Binomial coefficient binomial(n,4) = n*(n-1)*(n-2)*(n-3)/24.

  • A000337: a(n) = (n-1)*2^n + 1.

  • A000338: Expansion of x^3*(5-2*x)*(1-x^3)/(1-x)^4.

  • A000340: a(0)=1, a(n) = 3*a(n-1) + n + 1.

  • A000351: Powers of 5: a(n) = 5^n.

  • A000354: Expansion of e.g.f. exp(-x)/(1-2*x).

  • A000381: Essentially the same as A001611.

  • A000384: Hexagonal numbers: a(n) = n*(2*n-1).

  • A000392: Stirling numbers of second kind S(n,3).

  • A000400: Powers of 6: a(n) = 6^n.

  • A000403: Number of simple equifacetted 3-manifolds with n faces.

  • A000407: a(n) = (2*n+1)! / n!.

  • A000420: Powers of 7: a(n) = 7^n.

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

  • A000442: a(n) = (n!)^3.

  • A000447: a(n) = 1^2 + 3^2 + 5^2 + 7^2 + … + (2*n-1)^2 = n*(4*n^2 - 1)/3.

  • A000457: Exponential generating function: (1+3*x)/(1-2*x)^(7/2).

  • A000463: n followed by n^2.

  • A000466: a(n) = 4*n^2 - 1.

  • A000472: a(n) = a(n-1)^2 + (a(n-2) + 1)*(a(n-1) - a(n-2)^2).

  • A000510: Maximal number of points in PG(2,q) with at most 3 on a line (next term is 21 or 22).

  • A000515: a(n) = (2n)!(2n+1)!/n!^4, or equally (2n+1)*binomial(2n,n)^2.

  • A000522: Total number of ordered k-tuples (k=0..n) of distinct elements from an n-element set: a(n) = Sum_{k=0..n} n!/k!.

  • A000523: a(n) = floor(log_2(n)).

  • A000533: a(0)=1; a(n) = 10^n + 1, n >= 1.

  • A000537: Sum of first n cubes; or n-th triangular number squared.

  • A000538: Sum of fourth powers: 0^4 + 1^4 + … + n^4.

  • A000539: Sum of 5th powers: 0^5 + 1^5 + 2^5 + … + n^5.

  • A000540: Sum of 6th powers: 0^6 + 1^6 + 2^6 + … + n^6.

  • A000541: Sum of 7th powers: 1^7 + 2^7 + … + n^7.

  • A000542: Sum of 8th powers: 1^8 + 2^8 + … + n^8.

  • A000554: Number of labeled trees of diameter 3 with n nodes.

  • A000561: Number of discordant permutations.

  • A000566: Heptagonal numbers (or 7-gonal numbers): n*(5*n-3)/2.

  • A000567: Octagonal numbers: n*(3*n-2). Also called star numbers.

  • A000572: A Beatty sequence: [ n(e+1) ].

  • A000578: The cubes: a(n) = n^3.

  • A000580: a(n) = binomial coefficient C(n,7).

  • A000581: a(n) = binomial coefficient C(n,8).

  • A000582: a(n) = binomial coefficient C(n,9).

  • A000583: Fourth powers: a(n) = n^4.

  • A000584: Fifth powers: a(n) = n^5.

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

  • A000643: a(n) = a(n-1) + 2^a(n-2).

  • A000655: a(n) = number of letters in a(n-1), a(1) = 1 (in English).

  • A000659: a(n) = 2^a(n-1) + a(n-2).

  • A000680: a(n) = (2n)!/2^n.

  • A000689: Final decimal digit of 2^n.

  • A000703: Chromatic number (or Heawood number) of nonorientable surface with n crosscaps.

  • A000722: Number of invertible Boolean functions of n variables: a(n) = (2^n)!.

  • A000723: Invertible Boolean functions of n variables.

  • A000748: Expansion of bracket function.

  • A000749: a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3), n > 3, with a(0)=a(1)=a(2)=0, a(3)=1.

  • A000774: a(n) = n!*(1 + Sum_{i=1..n} 1/i).

  • A000776: a(n) = n! * (1 + 2*Sum_{k=1..n} 1/k).

  • A000777: a(n) = (n+2)*Catalan(n) - 1.

  • A000779: a(n) = 2*(2n-1)!!-(n-1)!*2^(n-1), where (2n-1)!! is A001147(n).

  • A000780: a(n) = (n+1)!/2 + (n-1)(n-1)!.

  • A000799: a(n) = floor(2^n / n).

  • A000801: a(n) = Sum_{k = 1..n} floor(2^k / k).

  • A000855: Final two digits of 2^n.

  • A000888: a(n) = (2*n)!^2 / ((n+1)!*n!^3).

  • A000891: a(n) = (2*n)!*(2*n+1)! / (n! * (n+1)!)^2.

  • A000894: a(n) = (2*n)!*(2*n+1)! /((n+1)! *n!^3).

  • A000897: a(n) = (4*n)! / ((2*n)!*n!^2).

  • A000906: Exponential generating function: 2*(1+3*x)/(1-2*x)^(7/2).

  • A000909: a(n) = (2*n)!*(2*n+1)! / n!^2.

  • A000911: a(n) = (2n+3)! /( n! * (n+1)! ).

  • A000914: Stirling numbers of the first kind: s(n+2, n).

  • A000917: a(n) = (2n+3)!/(n!*(n+2)!).

  • A000918: a(n) = 2^n - 2.

  • A000930: Narayana’s cows sequence: a(0) = a(1) = a(2) = 1; thereafter a(n) = a(n-1) + a(n-3).

  • A000933: Genus of complete graph on n nodes.

  • A000952: Numbers k == 2 (mod 4) that are the orders of conference matrices.

  • A000961: Powers of primes. Alternatively, 1 and the prime powers (p^k, p prime, k >= 1).

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

  • A000975: a(2n) = 2*a(2n-1), a(2n+1) = 2*a(2n)+1 (also a(n) is the n-th number without consecutive equal binary digits).

  • A000982: a(n) = ceiling(n^2/2).

  • A000984: Central binomial coefficients: binomial(2*n,n) = (2*n)!/(n!)^2.