Skip to content

Summary of block A027

98 sequences
  • A027004: a(n) = T(2*n+1,n+1), T given by A026998.

  • A027107: a(n) = Sum_{k=0..2n} (k+1) * A027082(n, 2n-k).

  • A027138: a(n) = Sum_{k=0..2n} (k+1) * A027113(n, 2n-k).

  • A027178: a(n) = T(n,0) + T(n,1) + … + T(n,n), T given by A027170.

  • A027180: a(n) = Sum_{0<=j<=i<=n} A027170(i, j).

  • A027181: a(n) = Lucas(n+4) - 2*(n+3).

  • A027261: a(n) = Sum_{k=0..2n} (k+1) * A025177(n, k).

  • A027266: a(n) = Sum_{k=0..2n} (k+1) * A026519(n, k).

  • A027271: a(n) = Sum_{k=0..2n} (k+1)*T(n,k), where T is given by A026536.

  • A027276: a(n) = Sum_{k=0..2n} (k+1) * A026552(n, k).

  • A027281: a(n) = Sum_{k=0..2n} (k+1) * A026568(n, k).

  • A027286: a(n) = Sum_{k=0..2n} (k+1) * A026584(n, k).

  • A027313: a(n) = Sum_{k=0..2n} (k+1) * A026323(n, 2n-k).

  • A027327: a(n) = Sum_{k=0..m} (k+1) * A026120(n, m-k), where m=0 for n=0,1; m=n for n >= 2.

  • A027334: a(n) = Sum_{k=0..m} (k+1) * A026148(n, m-k), where m=0 for n=1; m=n+1 for n >= 2.

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

  • A027379: Expansion of (1+x^2-x^3)/(1-x)^3.

  • A027382: a(n) = n^4 - 6*n^3 + 12*n^2 - 4*n + 1.

  • A027383: a(2*n) = 3*2^n - 2; a(2*n+1) = 2^(n+2) - 2.

  • A027418: Duplicate of A035508.

  • A027434: a(1) = 2; then defined by property that a(n) = smallest number >= a(n-1) such that successive runs have lengths 1,1,2,2,3,3,4,4.

  • A027437: a(n) = floor( e * 2^n ).

  • A027440: TV channels in Tokyo.

  • A027441: a(n) = (n^4 + n)/2 (Row sums of an n X n X n magic cube, when it exists).

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

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

  • A027468: 9 times the triangular numbers A000217.

  • A027469: a(n) = 49*(n-1)*(n-2)/2.

  • A027470: a(n) = 225*(n-1)*(n-2)/2.

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

  • A027472: Third convolution of the powers of 3 (A000244).

  • A027473: Second column of A027466.

  • A027474: a(n) = 7^(n-2) * C(n,2).

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

  • A027476: Third column of A027467.

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

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

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

  • A027540: Second diagonal of A027537.

  • A027556: Unbalanced strings of length n.

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

  • A027578: Sums of five consecutive squares: a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2 + (n+4)^2.

  • A027599: a(n) = 3*n^2 - 7*n + 6.

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

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

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

  • A027613: Degrees of polynomials involved in analysis of a binary-tree valued Markov chain depending on one parameter; each polynomial has a unique root in [ 0,1 ], which is a lower bound for the transition from positive recurrence to null recurrence.

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

  • A027637: a(n) = Product_{i=1..n} (4^i - 1).

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

  • A027650: Poly-Bernoulli numbers B_n^(k) with k=-3.

  • A027657: Expansion of (1+4*x)/(1-34*x+x^2).

  • A027659: a(n) = binomial(n+2,2) + binomial(n+3,3) + binomial(n+4,4) + binomial(n+5,5).

  • A027673: Number of nonisomorphic prime metrics on n points.

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

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

  • A027690: a(n) = n^2 + n + 5.

  • A027691: a(n) = n^2 + n + 6.

  • A027692: a(n) = n^2 + n + 7.

  • A027693: a(n) = n^2 + n + 8.

  • A027694: a(n) = n^2 + n + 9.

  • A027764: a(n) = (n+1)*binomial(n+1,4).

  • A027767: a(n) = (n+1)*binomial(n+1,7).

  • A027777: a(n) = 2*(n+1)*binomial(n+2,4).

  • A027789: a(n) = 2*(n+1)*binomial(n+3,4).

  • A027800: a(n) = (n+1)*binomial(n+4, 4).

  • A027810: a(n) = (n+1)*binomial(n+5, 5).

  • A027818: a(n) = (n+1)*binomial(n+6,6).

  • A027849: a(n) = (n+1)*(5*n^2+4*n+1).

  • A027865: Sums of six consecutive squares: a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2 + (n+4)^2 + (n+5)^2.

  • A027868: Number of trailing zeros in n!; highest power of 5 dividing n!.

  • A027871: a(n) = Product_{i=1..n} (3^i - 1).

  • A027872: a(n) = Product_{i=1..n} (5^i - 1).

  • A027873: a(n) = Product_{i=1..n} (6^i - 1).

  • A027875: a(n) = Product_{i=1..n} (7^i - 1).

  • A027876: a(n) = Product_{i=1..n} (8^i - 1).

  • A027877: a(n) = Product_{i=1..n} (9^i - 1).

  • A027878: a(n) = Product_{i=1..n} (10^i - 1).

  • A027879: a(n) = Product_{i=1..n} (11^i - 1).

  • A027880: a(n) = Product_{i=1..n} (12^i - 1).

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

  • A027916: Least k such that 1+2+…+k >= E{1,2,…,n}, where E = 2nd elementary symmetric function.

  • A027927: Number of plane regions after drawing (in general position) a convex n-gon and all its diagonals.

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

  • A027937: a(n) = T(2*n, n+1), T given by A027935.

  • A027941: a(n) = Fibonacci(2*n + 1) - 1.

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

  • A027961: a(n) = Lucas(n+2) - 3.

  • A027962: Duplicate of A023537.

  • A027965: T(n, 2*n-3), T given by A027960.

  • A027966: T(n, 2*n-4), T given by A027960.

  • A027973: a(n) = T(n,n) + T(n,n+1) + … + T(n,2n), T given by A027960.

  • A027974: a(n) = Sum_{k=1..n+1} A027960(n+1, n+1+k).

  • A027981: a(n) = Sum_{k=0..2*n} (k+1)*T(n,k), T given by A027960.

  • A027983: Duplicate of A027974.

  • A027992: a(n) = 1*T(n,0) + 2*T(n,1) + … + (2n+1)*T(n,2n), T given by A027926.

  • A027993: a(n) = 1*T(n,2n) + 2*T(n,2n-1) + … + (2n+1)*T(n,0), T given by A027926.

  • A027994: a(n) = (F(2n+3) - F(n))/2 where F() = Fibonacci numbers A000045.