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

A346921 Expansion of e.g.f. 1 / (1 - log(1 - x)^2 / 2).

Original entry on oeis.org

1, 0, 1, 3, 17, 110, 874, 8064, 85182, 1012248, 13369026, 194245590, 3079135806, 52880064588, 978038495316, 19381794788160, 409702099828104, 9201877089355584, 218832476773294008, 5493266481129425064, 145153549897858762776, 4027310838211114515600
Offset: 0

Views

Author

Ilya Gutkovskiy, Aug 07 2021

Keywords

Links

Crossrefs

Cf. A007840, A346922, A346923, A346924.
Cf. A000254, A052811, A305306, A330047, A347001.

Programs

  • Mathematica
    nmax = 21; CoefficientList[Series[1/(1 - Log[1 - x]^2/2), {x, 0, nmax}], x] Range[0, nmax]!
a[0] = 1; a[n_] := a[n] = Sum[Binomial[n, k] Abs[StirlingS1[k, 2]] a[n - k], {k, 1, n}]; Table[a[n], {n, 0, 21}]
  • PARI
    my(x='x+O('x^25)); Vec(serlaplace(1/(1-log(1-x)^2/2))) \\ Michel Marcus, Aug 07 2021
  • PARI
    a(n) = sum(k=0, n\2, (2*k)!*abs(stirling(n, 2*k, 1))/2^k); \\ Seiichi Manyama, May 06 2022

Formula

a(0) = 1; a(n) = Sum_{k=1..n} binomial(n,k) * |Stirling1(k,2)| * a(n-k).
a(n) ~ n! * exp(sqrt(2)*n) / (sqrt(2) * (exp(sqrt(2)) - 1)^(n+1)). - Vaclav Kotesovec, Aug 08 2021
a(n) = Sum_{k=0..floor(n/2)} (2*k)! * |Stirling1(n,2*k)|/2^k. - Seiichi Manyama, May 06 2022

A347002 Expansion of e.g.f. exp( -log(1 - x)^3 / 3! ).

Original entry on oeis.org

1, 0, 0, 1, 6, 35, 235, 1834, 16352, 163764, 1818030, 22143726, 293476326, 4203311892, 64682865156, 1064154324024, 18636296872320, 346103784493560, 6793394350116600, 140508244952179200, 3054120126193160280, 69596730438090806880, 1659041650323705102840
Offset: 0

Views

Author

Ilya Gutkovskiy, Aug 10 2021

Keywords

Links

Crossrefs

Cf. A000399, A327504, A346922, A347001, A347003, A347004.

Programs

  • Mathematica
    nmax = 22; CoefficientList[Series[Exp[-Log[1 - x]^3/3!], {x, 0, nmax}], x] Range[0, nmax]!
a[0] = 1; a[n_] := a[n] = Sum[Binomial[n - 1, k - 1] Abs[StirlingS1[k, 3]] a[n - k], {k, 1, n}]; Table[a[n], {n, 0, 22}]
  • PARI
    a(n) = sum(k=0, n\3, (3*k)!*abs(stirling(n, 3*k, 1))/(6^k*k!)); \\ Seiichi Manyama, May 06 2022

Formula

a(0) = 1; a(n) = Sum_{k=1..n} binomial(n-1,k-1) * |Stirling1(k,3)| * a(n-k).
a(n) = Sum_{k=0..floor(n/3)} (3*k)! * |Stirling1(n,3*k)|/(6^k * k!). - Seiichi Manyama, May 06 2022

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

Original entry on oeis.org

1, 0, 0, 0, 1, 10, 85, 735, 6804, 68544, 754130, 9044750, 117773656, 1656897528, 25061576176, 405667844400, 6997383182854, 128126051451184, 2481884332498848, 50702417505257904, 1089371806098805286, 24555007848629510700, 579348221233739760550, 14278529041496660104450
Offset: 0

Views

Author

Ilya Gutkovskiy, Aug 10 2021

Keywords

Links

Crossrefs

Cf. A000454, A327505, A346923, A347001, A347002, A347004.

Programs

  • Mathematica
    nmax = 23; CoefficientList[Series[Exp[Log[1 - x]^4/4!], {x, 0, nmax}], x] Range[0, nmax]!
a[0] = 1; a[n_] := a[n] = Sum[Binomial[n - 1, k - 1] Abs[StirlingS1[k, 4]] a[n - k], {k, 1, n}]; Table[a[n], {n, 0, 23}]
  • PARI
    a(n) = sum(k=0, n\4, (4*k)!*abs(stirling(n, 4*k, 1))/(24^k*k!)); \\ Seiichi Manyama, May 06 2022

Formula

a(0) = 1; a(n) = Sum_{k=1..n} binomial(n-1,k-1) * |Stirling1(k,4)| * a(n-k).
a(n) = Sum_{k=0..floor(n/4)} (4*k)! * |Stirling1(n,4*k)|/(24^k * k!). - Seiichi Manyama, May 06 2022

A347004 Expansion of e.g.f. exp( -log(1 - x)^5 / 5! ).

Original entry on oeis.org

1, 0, 0, 0, 0, 1, 15, 175, 1960, 22449, 269451, 3423860, 46238280, 664233856, 10143487354, 164423078456, 2823768543960, 51272283444264, 982177492263750, 19807082824819374, 419629806223448346, 9320808413229618816, 216645165604679499072, 5259724543984442886486
Offset: 0

Views

Author

Ilya Gutkovskiy, Aug 10 2021

Keywords

Links

Crossrefs

Cf. A000482, A327506, A346924, A347001, A347002, A347003.

Programs

  • Mathematica
    nmax = 23; CoefficientList[Series[Exp[-Log[1 - x]^5/5!], {x, 0, nmax}], x] Range[0, nmax]!
a[0] = 1; a[n_] := a[n] = Sum[Binomial[n - 1, k - 1] Abs[StirlingS1[k, 5]] a[n - k], {k, 1, n}]; Table[a[n], {n, 0, 23}]
  • PARI
    a(n) = sum(k=0, n\5, (5*k)!*abs(stirling(n, 5*k, 1))/(120^k*k!)); \\ Seiichi Manyama, May 06 2022

Formula

a(0) = 1; a(n) = Sum_{k=1..n} binomial(n-1,k-1) * |Stirling1(k,5)| * a(n-k).
a(n) = Sum_{k=0..floor(n/5)} (5*k)! * |Stirling1(n,5*k)|/(120^k * k!). - Seiichi Manyama, May 06 2022

A353891 Expansion of e.g.f. exp( (x * log(1-x))^2 / 4 ).

Original entry on oeis.org

1, 0, 0, 0, 6, 30, 165, 1050, 8932, 86184, 909360, 10393020, 129313206, 1743627600, 25314159780, 393346535400, 6512022804960, 114430467296880, 2127154061337480, 41703621476302800, 859966710771029040, 18606040434320713920, 421427283751799685360
Offset: 0

Views

Author

Seiichi Manyama, May 09 2022

Keywords

Crossrefs

Cf. A066166, A353892, A353893.
Cf. A347001, A353880, A353894.

Programs

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

Formula

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

A357036 E.g.f. satisfies A(x) = (1 - x * A(x))^(log(1 - x * A(x)) / 2).

Original entry on oeis.org

1, 0, 1, 3, 26, 230, 2794, 39564, 663606, 12712104, 275171106, 6632699040, 176309074644, 5123121177096, 161577261004860, 5497133655605760, 200683752698028924, 7825434930630743616, 324616635150708044796, 14273994548639305751040, 663205761925601097418488
Offset: 0

Views

Author

Seiichi Manyama, Sep 09 2022

Keywords

Crossrefs

Cf. A001761, A357037.
Cf. A347001, A357028.

Programs

  • Mathematica
    m = 21; (* number of terms *)
A[_] = 0;
Do[A[x_] = (1 - x*A[x])^(Log[1 - x*A[x]]/2) + O[x]^m // Normal, {m}];
CoefficientList[A[x], x]*Range[0, m - 1]! (* Jean-François Alcover, Sep 12 2022 *)
  • PARI
    a(n) = sum(k=0, n\2, (2*k)!*(n+1)^(k-1)*abs(stirling(n, 2*k, 1))/(2^k*k!));

Formula

E.g.f. satisfies log(A(x)) = log(1 - x * A(x))^2 / 2.
a(n) = Sum_{k=0..floor(n/2)} (2*k)! * (n+1)^(k-1) * |Stirling1(n,2*k)|/(2^k * k!).

A354317 Expansion of e.g.f. exp(-log(1 + x)^2 / 2).

Original entry on oeis.org

1, 0, -1, 3, -8, 20, -34, -126, 2514, -28008, 285774, -2922810, 30858048, -339954264, 3920819748, -47319853140, 596005041852, -7799132781792, 105344546511684, -1454910026870412, 20242465245436128, -276289562032117200, 3490199850169557480
Offset: 0

Views

Author

Seiichi Manyama, May 24 2022

Keywords

Crossrefs

Cf. A347001, A354318.

Programs

  • PARI
    my(N=30, x='x+O('x^N)); Vec(serlaplace(exp(-log(1+x)^2/2)))
  • PARI
    my(N=30, x='x+O('x^N)); Vec(serlaplace(1/(1+x)^(log(1+x)/2)))
  • 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-1, j-1)*stirling(j, 2, 1)*v[i-j+1])); v;
  • PARI
    a(n) = sum(k=0, n\2, (2*k)!*stirling(n, 2*k, 1)/((-2)^k*k!));

Formula

E.g.f.: 1/(1 + x)^(log(1 + x)/2).
a(0) = 1; a(n) = -Sum_{k=1..n} binomial(n-1,k-1) * Stirling1(k,2) * a(n-k).
a(n) = Sum_{k=0..floor(n/2)} (2*k)! * Stirling1(n,2*k)/((-2)^k * k!).

A357883 Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..n} (k*j)!* |Stirling1(n,k*j)|/(k!^j * j!).

Original entry on oeis.org

1, 1, 0, 1, 1, 0, 1, 0, 2, 0, 1, 0, 1, 6, 0, 1, 0, 0, 3, 24, 0, 1, 0, 0, 1, 14, 120, 0, 1, 0, 0, 0, 6, 80, 720, 0, 1, 0, 0, 0, 1, 35, 544, 5040, 0, 1, 0, 0, 0, 0, 10, 235, 4284, 40320, 0, 1, 0, 0, 0, 0, 1, 85, 1834, 38310, 362880, 0, 1, 0, 0, 0, 0, 0, 15, 735, 16352, 383256, 3628800, 0
Offset: 0

Views

Author

Seiichi Manyama, Oct 18 2022

Keywords

Examples

			Square array begins:
  1,   1,  1,  1,  1, 1, ...
  0,   1,  0,  0,  0, 0, ...
  0,   2,  1,  0,  0, 0, ...
  0,   6,  3,  1,  0, 0, ...
  0,  24, 14,  6,  1, 0, ...
  0, 120, 80, 35, 10, 1, ...

Crossrefs

Columns k=0-5 give: A000007, A000142, A347001, A347002, A347003, A347004.
Cf. A324162, A357119, A357881, A357882.

Programs

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

Formula

For k > 0, e.g.f. of column k: exp((-log(1-x))^k / k!).
T(0,k) = 1; T(n,k) = Sum_{j=1..n} binomial(n-1,j-1) * |Stirling1(j,k)| * T(n-j,k).
Showing 1-8 of 8 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.