cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A328748 Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) is Sum_{i=0..n} (-2)^(n-i)*binomial(n,i)*Sum_{j=0..i} binomial(i,j)^k.

Original entry on oeis.org

1, 1, 0, 1, 0, -1, 1, 0, 0, 2, 1, 0, 2, 0, -3, 1, 0, 6, 0, 0, 4, 1, 0, 14, 12, 6, 0, -5, 1, 0, 30, 72, 90, 0, 0, 6, 1, 0, 62, 300, 882, 360, 20, 0, -7, 1, 0, 126, 1080, 6690, 8400, 2040, 0, 0, 8, 1, 0, 254, 3612, 44706, 124920, 95180, 10080, 70, 0, -9
Offset: 0

Views

Author

Seiichi Manyama, Oct 27 2019

Keywords

Comments

T(n,k) is the constant term in the expansion of (-2 + Product_{j=1..k-1} (1 + x_j) + Product_{j=1..k-1} (1 + 1/x_j))^n for k > 0.

Examples

			Square array begins:
    1, 1, 1,   1,    1,      1, ...
    0, 0, 0,   0,    0,      0, ...
   -1, 0, 2,   6,   14,     30, ...
    2, 0, 0,  12,   72,    300, ...
   -3, 0, 6,  90,  882,   6690, ...
    4, 0, 0, 360, 8400, 124920, ...
		

Crossrefs

Columns k=0..5 give A097141(n+1), A000007, A126869, A002898, A328735, A328751.
T(n,n+1) gives A328814.

Programs

  • Mathematica
    T[n_, k_] := Sum[(-2)^(n-i) * Binomial[n, i] * Sum[Binomial[i, j]^k, {j, 0, i}], {i, 0, n}]; Table[T[k, n - k], {n, 0, 10}, {k, 0, n}] // Flatten (* Amiram Eldar, May 06 2021 *)

A328812 Constant term in the expansion of (Product_{k=1..n} (1 + x_k) + Product_{k=1..n} (1 + 1/x_k))^n.

Original entry on oeis.org

1, 2, 10, 164, 9826, 2031252, 1622278624, 4579408029576, 51207103076632066, 2052124795850957537060, 330463219813679264204224300, 192454957455454582636391397662856, 454577215426865313388106323928590128736, 3907905904547764847197154889183844343802986600
Offset: 0

Views

Author

Seiichi Manyama, Oct 28 2019

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := Sum[Binomial[n, k]^(n + 1), {k, 0, n}]; Array[a, 14, 0] (* Amiram Eldar, May 06 2021 *)
  • PARI
    {a(n) = sum(k=0, n, binomial(n, k)^(n+1))}

Formula

a(n) = A309010(n,n+1) = Sum_{k=0..n} binomial(n,k)^(n+1).
a(n) ~ c * exp(-1/4) * 2^((2*n+1)*(n+1)/2) / (Pi*n)^((n+1)/2), where c = A218792 = Sum_{k = -infinity..infinity} exp(-2*k^2) = 1.271341522189... and c = Sum_{k = -infinity..infinity} exp(-2*(k+1/2)^2) = 1.23528676585389... if n is odd. - Vaclav Kotesovec, May 06 2021

A328813 Constant term in the expansion of (-1 + Product_{k=1..n} (1 + x_k) + Product_{k=1..n} (1 + 1/x_k))^n.

Original entry on oeis.org

1, 1, 7, 115, 8071, 1770951, 1505946121, 4368457532265, 49949721645153751, 2021436054924485283799, 327902645022367779788597977, 191573267131797606250658812550565, 453516825886934673673734108656254582801
Offset: 0

Views

Author

Seiichi Manyama, Oct 28 2019

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := Sum[(-1)^(n-i) * Binomial[n, i] * Sum[Binomial[i, j]^(n+1), {j, 0, i}], {i, 0, n}]; Array[a, 13, 0] (* Amiram Eldar, May 06 2021 *)
  • PARI
    {a(n) = sum(i=0, n, (-1)^(n-i)*binomial(n, i)*sum(j=0, i, binomial(i, j)^(n+1)))}

Formula

a(n) = A328747(n,n+1) = Sum_{i=0..n} (-1)^(n-i)*binomial(n,i)*Sum_{j=0..i} binomial(i,j)^(n+1).
Showing 1-3 of 3 results.