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-5 of 5 results.

A346895 Expansion of e.g.f. 1 / (1 - (exp(x) - 1)^4 / 4!).

Original entry on oeis.org

1, 0, 0, 0, 1, 10, 65, 350, 1771, 10290, 86605, 977350, 11778041, 138208070, 1590920695, 18895490250, 245692484311, 3587464083850, 57397496312585, 966066470023550, 16713560617838581, 297182550111615630, 5500448659383161275, 107267326981597659250
Offset: 0

Views

Author

Ilya Gutkovskiy, Aug 06 2021

Keywords

Links

Crossrefs

Cf. A000670, A330047, A346894, A346920.
Cf. A000453, A327505, A346923, A353775.

Programs

  • Mathematica
    nmax = 23; CoefficientList[Series[1/(1 - (Exp[x] - 1)^4/4!), {x, 0, nmax}], x] Range[0, nmax]!
a[0] = 1; a[n_] := a[n] = Sum[Binomial[n, k] StirlingS2[k, 4] a[n - k], {k, 1, n}]; Table[a[n], {n, 0, 23}]
  • PARI
    my(x='x+O('x^25)); Vec(serlaplace(1/(1-(exp(x)-1)^4/4!))) \\ Michel Marcus, Aug 06 2021
  • PARI
    my(N=30, x='x+O('x^N)); Vec(sum(k=0, N, (4*k)!*x^(4*k)/(24^k*prod(j=1, 4*k, 1-j*x)))) \\ Seiichi Manyama, May 07 2022
  • PARI
    a_vector(n) = my(v=vector(n+1)); v[1]=1; for(i=1, n, v[i+1]=sum(j=1, i, binomial(i, j)*stirling(j, 4, 2)*v[i-j+1])); v; \\ Seiichi Manyama, May 07 2022
  • PARI
    a(n) = sum(k=0, n\4, (4*k)!*stirling(n, 4*k, 2)/24^k); \\ Seiichi Manyama, May 07 2022

Formula

a(0) = 1; a(n) = Sum_{k=1..n} binomial(n,k) * Stirling2(k,4) * a(n-k).
a(n) ~ n! / (4*(1 + 2^(-3/4)*3^(-1/4)) * log(1 + 2^(3/4)*3^(1/4))^(n+1)). - Vaclav Kotesovec, Aug 08 2021
From Seiichi Manyama, May 07 2022: (Start)
G.f.: Sum_{k>=0} (4*k)! * x^(4*k)/(24^k * Product_{j=1..4*k} (1 - j * x)).
a(n) = Sum_{k=0..floor(n/4)} (4*k)! * Stirling2(n,4*k)/24^k. (End)

A353774 Expansion of e.g.f. 1/(1 - (exp(x) - 1)^3).

Original entry on oeis.org

1, 0, 0, 6, 36, 150, 1260, 16926, 197316, 2286150, 32821020, 548528046, 9515702196, 174531124950, 3521913283980, 76969474578366, 1777400236160676, 43405229295464550, 1126972561394470140, 30949983774936839886, 893095888222540548756, 27035433957000465352950
Offset: 0

Views

Author

Seiichi Manyama, May 07 2022

Keywords

Links

Crossrefs

Cf. A000670, A052841, A353775.
Cf. A143815, A346894, A353118, A353664.

Programs

  • PARI
    my(N=30, x='x+O('x^N)); Vec(serlaplace(1/(1-(exp(x)-1)^3)))
  • PARI
    my(N=30, x='x+O('x^N)); Vec(sum(k=0, N, (3*k)!*x^(3*k)/prod(j=1, 3*k, 1-j*x)))
  • PARI
    a_vector(n) = my(v=vector(n+1)); v[1]=1; for(i=1, n, v[i+1]=6*sum(j=1, i, binomial(i, j)*stirling(j, 3, 2)*v[i-j+1])); v;
  • PARI
    a(n) = sum(k=0, n\3, (3*k)!*stirling(n, 3*k, 2));

Formula

G.f.: Sum_{k>=0} (3*k)! * x^(3*k)/Product_{j=1..3*k} (1 - j * x).
a(0) = 1; a(n) = 6 * Sum_{k=1..n} binomial(n,k) * Stirling2(k,3) * a(n-k).
a(n) = Sum_{k=0..floor(n/3)} (3*k)! * Stirling2(n,3*k).
a(n) ~ n! / (6 * log(2)^(n+1)). - Vaclav Kotesovec, May 08 2022

A353665 Expansion of e.g.f. exp((exp(x) - 1)^4).

Original entry on oeis.org

1, 0, 0, 0, 24, 240, 1560, 8400, 60984, 912240, 15938520, 242998800, 3300493944, 44583979440, 690641504280, 12868117189200, 264164524958904, 5481631005177840, 112822632387018840, 2367468210865875600, 52624238539033647864, 1258531092544541563440
Offset: 0

Views

Author

Seiichi Manyama, May 07 2022

Keywords

Crossrefs

Cf. A000110, A052859, A353664.
Cf. A327505, A353358, A353775.

Programs

  • PARI
    my(N=30, x='x+O('x^N)); Vec(serlaplace(exp((exp(x)-1)^4)))
  • PARI
    my(N=30, x='x+O('x^N)); Vec(sum(k=0, N, (4*k)!*x^(4*k)/(k!*prod(j=1, 4*k, 1-j*x))))
  • PARI
    a_vector(n) = my(v=vector(n+1)); v[1]=1; for(i=1, n, v[i+1]=24*sum(j=1, i, binomial(i-1, j-1)*stirling(j, 4, 2)*v[i-j+1])); v;
  • PARI
    a(n) = sum(k=0, n\4, (4*k)!*stirling(n, 4*k, 2)/k!);

Formula

E.g.f.: exp((exp(x) - 1)^4).
G.f.: Sum_{k>=0} (4*k)! * x^(4*k)/(k! * Product_{j=1..4*k} (1 - j * x)).
a(0) = 1; a(n) = 24 * Sum_{k=1..n} binomial(n-1,k-1) * Stirling2(k,4) * a(n-k).
a(n) = Sum_{k=0..floor(n/4)} (4*k)! * Stirling2(n,4*k)/k!.

A357868 Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..n} (k*j)!* Stirling2(n,k*j).

Original entry on oeis.org

1, 1, 0, 1, 1, 0, 1, 0, 3, 0, 1, 0, 2, 13, 0, 1, 0, 0, 6, 75, 0, 1, 0, 0, 6, 38, 541, 0, 1, 0, 0, 0, 36, 270, 4683, 0, 1, 0, 0, 0, 24, 150, 2342, 47293, 0, 1, 0, 0, 0, 0, 240, 1260, 23646, 545835, 0, 1, 0, 0, 0, 0, 120, 1560, 16926, 272918, 7087261, 0, 1, 0, 0, 0, 0, 0, 1800, 8400, 197316, 3543630, 102247563, 0
Offset: 0

Views

Author

Seiichi Manyama, Oct 17 2022

Keywords

Examples

			Square array begins:
  1,   1,   1,   1,   1,   1, ...
  0,   1,   0,   0,   0,   0, ...
  0,   3,   2,   0,   0,   0, ...
  0,  13,   6,   6,   0,   0, ...
  0,  75,  38,  36,  24,   0, ...
  0, 541, 270, 150, 240, 120, ...

Crossrefs

Columns k=0-4 give: A000007, A000670, A052841, A353774, A353775.
Cf. A324162, A357293, A357869, A357881.

Programs

  • PARI
    T(n, k) = sum(j=0, n, (k*j)!*stirling(n, k*j, 2));
  • PARI
    T(n, k) = if(k==0, 0^n, n!*polcoef(1/(1-(exp(x+x*O(x^n))-1)^k), n));

Formula

For k > 0, e.g.f. of column k: 1/(1 - (exp(x) - 1)^k).
T(0,k) = 1; T(n,k) = k! * Sum_{j=1..n} binomial(n,j) * Stirling2(j,k) * T(n-j,k).

A373940 Expansion of e.g.f. 1/(1 - (exp(x) - 1)^5).

Original entry on oeis.org

1, 0, 0, 0, 0, 120, 1800, 16800, 126000, 834120, 8731800, 229191600, 6352632000, 143603580120, 2736395461800, 47283190718400, 860150574738000, 20236134851478120, 614854122909391800, 19930647062659477200, 615406024970593164000, 17883373100352330768120
Offset: 0

Views

Author

Seiichi Manyama, Aug 27 2024

Keywords

Crossrefs

Cf. A000670, A052841, A353774, A353775.
Cf. A353200.

Programs

  • PARI
    my(N=30, x='x+O('x^N)); Vec(serlaplace(1/(1-(exp(x)-1)^5)))
  • PARI
    a_vector(n) = my(v=vector(n+1)); v[1]=1; for(i=1, n, v[i+1]=120*sum(j=1, i, binomial(i, j)*stirling(j, 5, 2)*v[i-j+1])); v;
  • PARI
    a(n) = sum(k=0, n\5, (5*k)!*stirling(n, 5*k, 2));

Formula

G.f.: Sum_{k>=0} (5*k)! * x^(5*k)/Product_{j=1..5*k} (1 - j * x).
a(0) = 1; a(n) = 120 * Sum_{k=1..n} binomial(n,k) * Stirling2(k,5) * a(n-k).
a(n) = Sum_{k=0..floor(n/5)} (5*k)! * Stirling2(n,5*k).
a(n) ~ n! / (10 * log(2)^(n+1)). - Vaclav Kotesovec, Aug 27 2024
Showing 1-5 of 5 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.