Skip to content

Summary of block A001

212 sequences
  • A001014: Sixth powers: a(n) = n^6.

  • A001015: Seventh powers: a(n) = n^7.

  • A001016: Eighth powers: a(n) = n^8.

  • A001017: Ninth powers: a(n) = n^9.

  • A001018: Powers of 8: a(n) = 8^n.

  • A001019: Powers of 9: a(n) = 9^n.

  • A001020: Powers of 11: a(n) = 11^n.

  • A001021: Powers of 12.

  • A001022: Powers of 13.

  • A001023: Powers of 14.

  • A001024: Powers of 15.

  • A001025: Powers of 16: a(n) = 16^n.

  • A001026: Powers of 17.

  • A001027: Powers of 18.

  • A001029: Powers of 19.

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

  • A001044: a(n) = (n!)^2.

  • A001045: Jacobsthal sequence (or Jacobsthal numbers): a(n) = a(n-1) + 2*a(n-2), with a(0) = 0, a(1) = 1; also a(n) = nearest integer to 2^n/3.

  • A001047: a(n) = 3^n - 2^n.

  • A001048: a(n) = n! + (n-1)!.

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

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

  • A001057: Canonical enumeration of integers: interleaved positive and negative integers with zero prepended.

  • A001060: a(n) = a(n-1) + a(n-2) with a(0)=2, a(1)=5. Sometimes called the Evangelist Sequence.

  • A001068: a(n) = floor(5*n/4), numbers that are congruent to {0, 1, 2, 3} mod 5.

  • A001075: a(0) = 1, a(1) = 2, a(n) = 4*a(n-1) - a(n-2).

  • A001076: Denominators of continued fraction convergents to sqrt(5).

  • A001077: Numerators of continued fraction convergents to sqrt(5).

  • A001078: a(n) = 10*a(n-1) - a(n-2) with a(0) = 0, a(1) = 2.

  • A001079: a(n) = 10*a(n-1) - a(n-2); a(0) = 1, a(1) = 5.

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

  • A001082: Generalized octagonal numbers: k*(3*k-2), k=0, +- 1, +- 2, +-3, …

  • A001090: a(n) = 8*a(n-1) - a(n-2); a(0) = 0, a(1) = 1.

  • A001091: a(n) = 8*a(n-1) - a(n-2); a(0) = 1, a(1) = 4.

  • A001094: a(n) = n + n*(n-1)*(n-2)*(n-3).

  • A001095: a(n) = n + n*(n-1)*(n-2)*(n-3)*(n-4).

  • A001099: a(n) = n^n - a(n-1), with a(1) = 1.

  • A001105: a(n) = 2*n^2.

  • A001106: 9-gonal (or enneagonal or nonagonal) numbers: a(n) = n*(7*n-5)/2.

  • A001107: 10-gonal (or decagonal) numbers: a(n) = n*(4*n-3).

  • A001108: a(n)-th triangular number is a square: a(n+1) = 6*a(n) - a(n-1) + 2, with a(0) = 0, a(1) = 1.

  • A001109: a(n)^2 is a triangular number: a(n) = 6*a(n-1) - a(n-2) with a(0)=0, a(1)=1.

  • A001110: Square triangular numbers: numbers that are both triangular and square.

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

  • A001119: Number of skew-symmetric Hadamard matrices of order 4n.

  • A001142: a(n) = Product_{k=1..n} k^(2k - 1 - n).

  • A001146: a(n) = 2^(2^n).

  • A001147: Double factorial of odd numbers: a(n) = (2*n-1)!! = 1*3*5*…*(2*n-1).

  • A001148: Final digit of 3^n.

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

  • A001194: a(n) = A059366(n,n-2) = A059366(n,2) for n >= 2, where the triangle A059366 arises in the expansion of a trigonometric integral.

  • A001218: a(n) = 3^n mod 100.

  • A001231: Number of nonisomorphic projective planes of order n.

  • A001240: Expansion of 1/((1-2x)(1-3x)(1-6x)).

  • A001246: Squares of Catalan numbers.

  • A001249: Squares of tetrahedral numbers: a(n) = binomial(n+3,n)^2.

  • A001254: Squares of Lucas numbers.

  • A001264: Final 2 digits of 4^n.

  • A001277: Number of permutations of length n by rises.

  • A001281: Image of n under the map n->n/2 if n even, n->3n-1 if n odd.

  • A001285: Thue-Morse sequence: let A_k denote the first 2^k terms; then A_0 = 1 and for k >= 0, A_{k+1} = A_k B_k, where B_k is obtained from A_k by interchanging 1’s and 2’s.

  • A001286: Lah numbers: a(n) = (n-1)*n!/2.

  • A001287: a(n) = binomial coefficient C(n,10).

  • A001288: a(n) = binomial(n,11).

  • A001291: Number of conjugacy classes in Restricted Affine Group on n variables.

  • A001296: 4-dimensional pyramidal numbers: a(n) = (3*n+1)*binomial(n+2, 3)/4. Also Stirling2(n+2, n).

  • A001297: Stirling numbers of the second kind S(n+3, n).

  • A001311: Final 2 digits of 6^n.

  • A001318: Generalized pentagonal numbers: m*(3*m - 1)/2, m = 0, +-1, +-2, +-3, …

  • A001320: Number of self-complementary Boolean functions of n variables, up to equivalence under the group (C_2)^n of all 2^n complementations of variables.

  • A001333: Pell-Lucas numbers: numerators of continued fraction convergents to sqrt(2).

  • A001339: a(n) = Sum_{k=0..n} (k+1)! binomial(n,k).

  • A001340: E.g.f.: 2*exp(x)/(1-x)^3.

  • A001350: Associated Mersenne numbers.

  • A001352: a(0) = 1, a(1) = 6, a(2) = 24; for n>=3, a(n) = 4a(n-1) - a(n-2).

  • A001353: a(n) = 4*a(n-1) - a(n-2) with a(0) = 0, a(1) = 1.

  • A001354: Coordination sequence for hyperbolic tessellation 3^7 (from triangle group (2,3,7)).

  • A001360: Crystal ball sequence for hyperbolic tessellation 3^7 (from triangle group (2,3,7)).

  • A001367: Solution to f(2) = 1, f(n) = sqrt(n) f(sqrt(n)) + n at values n = 2^2^i.

  • A001399: a(n) is the number of partitions of n into at most 3 parts; also partitions of n+3 in which the greatest part is 3; also number of unlabeled multigraphs with 3 nodes and n edges.

  • A001405: a(n) = binomial(n, floor(n/2)).

  • A001438: Maximal number of mutually orthogonal Latin squares (or MOLS) of order n.

  • A001444: Bending a piece of wire of length n+1 (configurations that can only be brought into coincidence by turning the figure over are counted as different).

  • A001445: a(n) = (2^n + 2^[ n/2 ] )/2.

  • A001448: a(n) = binomial(4n,2n) or (4*n)!/((2*n)!*(2*n)!).

  • A001453: Catalan numbers - 1.

  • A001477: The nonnegative integers.

  • A001478: The negative integers.

  • A001489: a(n) = -n.

  • A001504: a(n) = (3*n+1)*(3*n+2).

  • A001505: a(n) = (4n+1)(4n+2)(4n+3).

  • A001509: a(n) = (5*n + 1)*(5*n + 2)*(5*n + 3).

  • A001510: a(n) = 2*a(n-1)*(a(n-1)-1) for n > 1, with a(0) = 1, a(1) = 2.

  • A001512: a(n) = (5*n+1)*(5*n+2)*(5*n+3)*(5*n+4).

  • A001513: a(n) = (6*n+1)*(6*n+5).

  • A001519: a(n) = 3*a(n-1) - a(n-2) for n >= 2, with a(0) = a(1) = 1.

  • A001525: a(n) = (3n)!/(3!n!).

  • A001526: a(n) = (7*n+1)*(7*n+6).

  • A001533: a(n) = (8*n+1)*(8*n+7).

  • A001534: a(n) = (9*n+1)*(9*n+8).

  • A001535: a(n) = (10n+1)*(10n+9).

  • A001536: a(n) = (11*n+1)*(11*n+10).

  • A001538: a(n) = (12*n+1)*(12*n+11).

  • A001539: a(n) = (4*n+1)*(4*n+3).

  • A001540: Number of transpositions needed to generate permutations of length n.

  • A001541: a(0) = 1, a(1) = 3; for n > 1, a(n) = 6*a(n-1) - a(n-2).

  • A001542: a(n) = 6*a(n-1) - a(n-2) for n > 1, a(0)=0 and a(1)=2.

  • A001543: a(0) = 1, a(n) = 5 + Product_{i=0..n-1} a(i) for n > 0.

  • A001544: A nonlinear recurrence: a(n) = a(n-1)^2 - 6*a(n-1) + 6, with a(0) = 1, a(1) = 7.

  • A001545: a(n) = (5*n+1)*(5*n+4).

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

  • A001551: a(n) = 1^n + 2^n + 3^n + 4^n.

  • A001552: a(n) = 1^n + 2^n + … + 5^n.

  • A001553: a(n) = 1^n + 2^n + … + 6^n.

  • A001563: a(n) = n*n! = (n+1)! - n!.

  • A001564: 2nd differences of factorial numbers.

  • A001566: a(0) = 3; thereafter, a(n) = a(n-1)^2 - 2.

  • A001570: Numbers k such that k^2 is centered hexagonal.

  • A001571: a(n) = 4*a(n-1) - a(n-2) + 1, with a(0) = 0, a(1) = 2.

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

  • A001579: a(n) = 3^n + 5^n + 6^n.

  • A001580: a(n) = 2^n + n^2.

  • A001582: Product of Fibonacci and Pell numbers.

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

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

  • A001589: a(n) = 4^n + n^4.

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

  • A001594: a(n) = 6^n + n^6.

  • A001595: a(n) = a(n-1) + a(n-2) + 1, with a(0) = a(1) = 1.

  • A001596: a(n) = 7^n + n^7.

  • A001601: a(n) = 2*a(n-1)^2 - 1, if n>1. a(0)=1, a(1)=3.

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

  • A001610: a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 2.

  • A001611: a(n) = Fibonacci(n) + 1.

  • A001612: a(n) = a(n-1) + a(n-2) - 1 for n > 1, a(0)=3, a(1)=2.

  • A001614: Connell sequence: 1 odd, 2 even, 3 odd, …

  • A001621: a(n) = n*(n + 1)*(n^2 + n + 2)/4.

  • A001647: Number of indecomposable self-dual codes of length 2n over GF(4).

  • A001650: k appears k times (k odd).

  • A001651: Numbers not divisible by 3.

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

  • A001653: Numbers k such that 2*k^2 - 1 is a square.

  • A001654: Golden rectangle numbers: F(n) * F(n+1), where F(n) = A000045(n) (Fibonacci numbers).

  • A001670: k appears k times (k even).

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

  • A001697: a(n+1) = a(n)(a(0) + … + a(n)).

  • A001699: Number of binary trees of height n; or products (ways to insert parentheses) of height n when multiplication is non-commutative and non-associative.

  • A001700: a(n) = binomial(2*n+1, n+1): number of ways to put n+1 indistinguishable balls into n+1 distinguishable boxes = number of (n+1)-st degree monomials in n+1 variables = number of monotone maps from 1..n+1 to 1..n+1.

  • A001705: Generalized Stirling numbers: a(n) = n! * Sum_{k=0..n-1} (k+1)/(n-k).

  • A001710: Order of alternating group A_n, or number of even permutations of n letters.

  • A001715: a(n) = n!/6.

  • A001720: a(n) = n!/24.

  • A001725: a(n) = n!/5!.

  • A001730: a(n) = n!/6!.

  • A001754: Lah numbers: a(n) = n!*binomial(n-1,2)/6.

  • A001755: Lah numbers: a(n) = n! * binomial(n-1, 3)/4!.

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

  • A001764: a(n) = binomial(3*n,n)/(2*n+1) (enumerates ternary trees and also noncrossing trees).

  • A001786: Expansion of 1/((1+x)*(1-x)^11).

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

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

  • A001789: a(n) = binomial(n,3)*2^(n-3).

  • A001791: a(n) = binomial coefficient C(2n, n-1).

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

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

  • A001794: Negated coefficients of Chebyshev T polynomials: [x^n](-T(n+6, x)), n >= 0.

  • A001804: a(n) = n! * C(n,2).

  • A001809: a(n) = n! * n(n-1)/4.

  • A001813: Quadruple factorial numbers: a(n) = (2n)!/n!.

  • A001814: Coefficient of H_2 when expressing x^{2n} in terms of Hermite polynomials H_m.

  • A001815: a(n) = binomial(n,2) * 2^(n-1).

  • A001816: Coefficients of x^n in Hermite polynomial H_{n+4}.

  • A001818: Squares of double factorials: (1*3*5*…*(2n-1))^2 = ((2*n-1)!!)^2.

  • A001834: a(0) = 1, a(1) = 5, a(n) = 4*a(n-1) - a(n-2).

  • A001835: a(n) = 4*a(n-1) - a(n-2), with a(0) = 1, a(1) = 1.

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

  • A001841: Related to Zarankiewicz’s problem.

  • A001844: Centered square numbers: a(n) = 2*n*(n+1)+1. Sums of two consecutive squares. Also, consider all Pythagorean triples (X, Y, Z=Y+1) ordered by increasing Z; then sequence gives Z values.

  • A001845: Centered octahedral numbers (crystal ball sequence for cubic lattice).

  • A001846: Centered 4-dimensional orthoplex numbers (crystal ball sequence for 4-dimensional cubic lattice).

  • A001855: Sorting numbers: maximal number of comparisons for sorting n elements by binary insertion.

  • A001859: Triangular numbers plus quarter-squares: n*(n+1)/2 + floor((n+1)^2/4) (i.e., A000217(n) + A002620(n+1)).

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

  • A001880: Coefficients of Bessel polynomials y_n (x).

  • A001881: Coefficients of Bessel polynomials y_n (x).

  • A001891: Hit polynomials; convolution of natural numbers with Fibonacci numbers F(2), F(3), F(4), …

  • A001900: Successive numerators of Wallis’s approximation to Pi/2 (unreduced).

  • A001903: Final digit of 7^n.

  • A001906: F(2n) = bisection of Fibonacci sequence: a(n) = 3*a(n-1) - a(n-2).

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

  • A001908: E.g.f. exp(-x)/(1-5*x).

  • A001911: a(n) = Fibonacci(n+3) - 2.

  • A001921: a(n) = 14*a(n-1) - a(n-2) + 6 for n>1, a(0)=0, a(1)=7.

  • A001922: Numbers k such that 3*k^2 - 3*k + 1 is both a square (A000290) and a centered hexagonal number (A003215).

  • A001923: a(n) = Sum_{k=1..n} k^k.

  • A001924: Apply partial sum operator twice to Fibonacci numbers.

  • A001932: Sum of Fibonacci (A000045) and Pell (A000129) numbers.

  • A001946: a(n) = 11*a(n-1) + a(n-2).

  • A001947: a(n) = Lucas(5*n+2).

  • A001950: Upper Wythoff sequence (a Beatty sequence): a(n) = floor(n*phi^2), where phi = (1+sqrt(5))/2.

  • A001951: A Beatty sequence: a(n) = floor(n*sqrt(2)).

  • A001952: A Beatty sequence: a(n) = floor(n*(2 + sqrt(2))).

  • A001953: a(n) = floor((n + 1/2) * sqrt(2)).

  • A001954: a(n) = floor((n+1/2)*(2+sqrt(2))); winning positions in the 2-Wythoff game.

  • A001962: A Beatty sequence: floor(n * (sqrt(5) + 3)).

  • A001965: u-pile count for the 4-Wythoff game with i=2.

  • A001966: v-pile counts for the 4-Wythoff game with i=2.

  • A001969: Evil numbers: nonnegative integers with an even number of 1’s in their binary expansion.

  • A001971: Nearest integer to n^2/8.

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

  • A001998: Bending a piece of wire of length n+1; walks of length n+1 on a tetrahedron; also non-branched catafusenes with n+2 condensed hexagons.

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