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.

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

Crossrefs

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

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

Original entry on oeis.org

1, 0, 0, 0, 1, 10, 85, 735, 6839, 69804, 784580, 9680000, 130312336, 1901581968, 29895585356, 503657235900, 9051009737834, 172807817059664, 3493189152511608, 74530548004474584, 1673793045085649146, 39467836062718058100, 974939402596817961050, 25177327470510057799550
Offset: 0

Views

Author

Ilya Gutkovskiy, Aug 07 2021

Keywords

Crossrefs

Programs

  • Mathematica
    nmax = 23; CoefficientList[Series[1/(1 - Log[1 - x]^4/4!), {x, 0, nmax}], x] Range[0, nmax]!
    a[0] = 1; a[n_] := a[n] = Sum[Binomial[n, k] Abs[StirlingS1[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-log(1-x)^4/4!))) \\ Michel Marcus, Aug 07 2021
    
  • PARI
    a(n) = sum(k=0, n\4, (4*k)!*abs(stirling(n, 4*k, 1))/24^k); \\ Seiichi Manyama, May 06 2022

Formula

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

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

Original entry on oeis.org

1, 0, 1, 3, 14, 80, 544, 4284, 38310, 383256, 4239006, 51345690, 675770028, 9600349824, 146396925648, 2384700728760, 41320373582652, 758780222426592, 14718569154071964, 300706641183038292, 6453691377726073128, 145154958710291611200, 3414131149418742544320
Offset: 0

Views

Author

Ilya Gutkovskiy, Aug 10 2021

Keywords

Crossrefs

Programs

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

Formula

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!). - 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

Crossrefs

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

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

Original entry on oeis.org

1, 0, 0, 0, 24, 240, 2040, 17640, 182616, 2340576, 34907520, 567732000, 9811675104, 179804319552, 3507724531584, 72964001073600, 1614757714491456, 37860036000293376, 936291898320463872, 24333527620574701056, 662723505438520771584, 18871765275000834201600
Offset: 0

Views

Author

Seiichi Manyama, May 06 2022

Keywords

Crossrefs

Column k=4 of A357882.

Programs

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

Formula

E.g.f.: (1 - x)^((log(1 - x))^3).
a(0) = 1; a(n) = 24 * 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)|/k!.

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

Original entry on oeis.org

1, 0, 0, 0, 0, 0, 0, 0, 70, 1260, 17850, 242550, 3350655, 48108060, 724403680, 11478967500, 191601229820, 3367499575440, 62253354650760, 1208755315895400, 24611454394536780, 524613603866302440, 11687734234226039220, 271715852337632107020
Offset: 0

Views

Author

Seiichi Manyama, May 09 2022

Keywords

Crossrefs

Programs

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

Formula

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

A354318 Expansion of e.g.f. exp(-log(1 + x)^4 / 24).

Original entry on oeis.org

1, 0, 0, 0, -1, 10, -85, 735, -6734, 66024, -693230, 7774250, -92754046, 1172033148, -15609023066, 217966080150, -3173198858894, 47842246890224, -740798341880328, 11644416638285544, -182433719522266066, 2752864573552860900, -36826753489645422050
Offset: 0

Views

Author

Seiichi Manyama, May 24 2022

Keywords

Crossrefs

Programs

  • Mathematica
    With[{nn=30},CoefficientList[Series[Exp[-Log[1+x]^4/24],{x,0,nn}],x] Range[0,nn]!] (* Harvey P. Dale, Dec 27 2022 *)
  • PARI
    my(N=30, x='x+O('x^N)); Vec(serlaplace(exp(-log(1+x)^4/24)))
    
  • PARI
    my(N=30, x='x+O('x^N)); Vec(serlaplace(1/(1+x)^(log(1+x)^3/24)))
    
  • 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, 4, 1)*v[i-j+1])); v;
    
  • PARI
    a(n) = sum(k=0, n\4, (4*k)!*stirling(n, 4*k, 1)/((-24)^k*k!));

Formula

E.g.f.: 1/(1 + x)^(log(1 + x)^3 / 24).
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!).

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

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.