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

A007113 Expansion of e.g.f. (1 + x)^x.

Original entry on oeis.org

1, 0, 2, -3, 20, -90, 594, -4200, 34544, -316008, 3207240, -35699400, 432690312, -5672581200, 79991160144, -1207367605080, 19423062612480, -331770360922560, 5997105160795584, -114373526841360000, 2295170834453089920, -48344592370577247360
Offset: 0

Views

Author

Keywords

References

  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
  • R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Example 5.2.3.

Crossrefs

Cf. A053489, A053490. Apart from initial terms and signs, same as A066166.

Programs

  • Maple
    a:= n-> n! *coeff(series((1+x)^x, x, n+1), x, n):
    seq(a(n), n=0..30);  # Alois P. Heinz, Dec 12 2012
  • Mathematica
    CoefficientList[Series[(1 + x)^x, {x, 0, 19}], x]*Table[(n - 1)!, {n, 1, 20}]
    a[n_] := (-1)^n*n!*Sum[ StirlingS1[n - k, k]/(n - k)!*(-1)^(n - 2*k), {k, 1, n}]; a[0] = 1; Table[a[n], {n, 0, 19}] (* Jean-François Alcover, Dec 12 2012, after Vladeta Jovovic *)

Formula

a(n) = Sum_{k=0..floor(n/2)} binomial(n, k)*k!*Stirling1(n-k, k). - Vladeta Jovovic, Dec 19 2004
a(n) ~ (-1)^n * n!. - Vaclav Kotesovec, Jun 06 2019

Extensions

Signs from Christian G. Bower, Nov 15 1998

A053490 Expansion of e.g.f.: (1-x)^(-3x).

Original entry on oeis.org

1, 0, 6, 9, 132, 630, 6642, 55440, 608976, 6790392, 85413960, 1145077560, 16600386888, 256806229680, 4233767671728, 74015194485960, 1368023697469440, 26649263762049600, 545697922821501888, 11717708270380421760, 263276186128105633920
Offset: 0

Views

Author

N. J. A. Sloane, Jan 15 2000

Keywords

References

  • R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Example 5.2.3.

Crossrefs

Programs

  • Magma
    m:=30; R:=PowerSeriesRing(Rationals(), m); b:=Coefficients(R!((1-x)^(-3*x))); [Factorial(n-1)*b[n]: n in [1..m]]; // G. C. Greubel, Aug 29 2018
  • Mathematica
    CoefficientList[Series[(1-x)^(-3*x), {x, 0, 20}], x] * Range[0, 20]! (* Vaclav Kotesovec, Apr 21 2014 *)
  • PARI
    x='x+O('x^30); Vec(serlaplace((1-x)^(-3*x))) \\ G. C. Greubel, Aug 29 2018
    

Formula

a(n) = (-1)^n*Sum_{k=0..floor(n/2)} 3^k*binomial(n, k)*k!*Stirling1(n-k, k). - Vladeta Jovovic, Dec 19 2004
a(n) ~ n! * n^2/2 * (1 + (9-6*log(n)-6*gamma)/n), where gamma is the Euler-Mascheroni constant (A001620). - Vaclav Kotesovec, Apr 21 2014

A053491 Expansion of e.g.f. (1-2*x)^(-x).

Original entry on oeis.org

1, 0, 4, 12, 112, 960, 10848, 141120, 2122496, 36094464, 685578240, 14385761280, 330532435968, 8253827112960, 222587077558272, 6447285982126080, 199630453605335040, 6580280144225894400, 230056747973625249792, 8503148524089755566080
Offset: 0

Views

Author

N. J. A. Sloane, Jan 15 2000

Keywords

Crossrefs

Programs

  • Mathematica
    CoefficientList[Series[(1-2x)^(-x), {x, 0, 20}], x]* Range[0, 20]! (* Vaclav Kotesovec, Jun 27 2013 *)
  • PARI
    a(n) = n!*sum(k=0, n\2, 2^(n-k)*abs(stirling(n-k, k, 1))/(n-k)!); \\ Seiichi Manyama, May 20 2022

Formula

a(n) ~ 2^(n+1/2)*n^n/exp(n). - Vaclav Kotesovec, Jun 27 2013
a(n) = n! * Sum_{k=0..floor(n/2)} 2^(n-k) * |Stirling1(n-k,k)|/(n-k)!. - Seiichi Manyama, May 20 2022

A318615 a(n) = n! * [x^n] 1/(1 - x)^(n*x).

Original entry on oeis.org

1, 0, 4, 9, 224, 1650, 38664, 540960, 13930496, 291769128, 8598924000, 237964577400, 8082061452288, 275311724996880, 10714824398213376, 430458433091505000, 19007133744632954880, 876046954673290438080, 43416883192646088235008, 2252711496770428822876800, 124040138653975179571200000
Offset: 0

Views

Author

Ilya Gutkovskiy, Aug 30 2018

Keywords

Crossrefs

Programs

  • Mathematica
    Table[n! SeriesCoefficient[1/(1 - x)^(n x), {x, 0, n}], {n, 0, 20}]
    Join[{1}, Table[(-1)^n n! Sum[n^(n - k) StirlingS1[k, n - k]/k!, {k, n}], {n, 20}]]

Formula

a(n) = n! * [x^n] exp(n*x*Sum_{k>=1} x^k/k).
a(n) = (-1)^n*n! * Sum_{k=0..n} n^(n-k)*Stirling1(k,n-k)/k!.
a(n) ~ n^n / (sqrt(1 - (1-s)*(2-s)*s) * exp(n) * s^n * (1-s)^(s*n - 1)), where s = 0.530402312512063468084914246777198746... is the root of the equation (1-s)*(2 + s + s*log(1-s)) = 1. - Vaclav Kotesovec, Aug 30 2018

A351733 Expansion of e.g.f. exp( 2 * x * (exp(x) - 1) ).

Original entry on oeis.org

1, 0, 4, 6, 56, 250, 1812, 12614, 101040, 864882, 7988780, 78726142, 823897032, 9111774698, 106068603396, 1295153135670, 16538681229152, 220281968528098, 3053087839536732, 43941561067048430, 655501502129291640, 10118103843683127642
Offset: 0

Views

Author

Seiichi Manyama, May 20 2022

Keywords

Crossrefs

Programs

  • PARI
    my(N=30, x='x+O('x^N)); Vec(serlaplace(exp(2*x*(exp(x)-1))))
    
  • PARI
    a(n) = n!*sum(k=0, n\2, 2^k*stirling(n-k, k, 2)/(n-k)!);

Formula

a(n) = n! * Sum_{k=0..floor(n/2)} 2^k * Stirling2(n-k,k)/(n-k)!.

A362834 Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = (-1)^n * n! * Sum_{j=0..floor(n/2)} k^j * Stirling1(n-j,j)/(n-j)!.

Original entry on oeis.org

1, 1, 0, 1, 0, 0, 1, 0, 2, 0, 1, 0, 4, 3, 0, 1, 0, 6, 6, 20, 0, 1, 0, 8, 9, 64, 90, 0, 1, 0, 10, 12, 132, 300, 594, 0, 1, 0, 12, 15, 224, 630, 2568, 4200, 0, 1, 0, 14, 18, 340, 1080, 6642, 20160, 34544, 0, 1, 0, 16, 21, 480, 1650, 13536, 55440, 193856, 316008, 0
Offset: 0

Views

Author

Seiichi Manyama, May 05 2023

Keywords

Examples

			Square array begins:
  1,  1,   1,   1,    1,    1, ...
  0,  0,   0,   0,    0,    0, ...
  0,  2,   4,   6,    8,   10, ...
  0,  3,   6,   9,   12,   15, ...
  0, 20,  64, 132,  224,  340, ...
  0, 90, 300, 630, 1080, 1650, ...
		

Crossrefs

Columns k=0..3 give: A000007, A066166, A053489, A053490.
Main diagonal gives A318615.
Cf. A361652.

Programs

  • PARI
    T(n, k) = (-1)^n*n!*sum(j=0, n\2, k^j*stirling(n-j, j, 1)/(n-j)!);

Formula

E.g.f. of column k: 1/(1 - x)^(k*x).
Showing 1-6 of 6 results.