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

A346432 a(0) = 1; a(n) = n! * Sum_{k=0..n-1} (n-k+1) * a(k) / k!.

Original entry on oeis.org

1, 2, 14, 144, 1968, 33600, 688320, 16450560, 449326080, 13806858240, 471395635200, 17703899136000, 725338710835200, 32193996432998400, 1538840509503897600, 78808952068374528000, 4305129487814098944000, 249876735246162984960000, 15356385691181506363392000
Offset: 0

Views

Author

Ilya Gutkovskiy, Jul 17 2021

Keywords

Crossrefs

Programs

  • Mathematica
    a[0] = 1; a[n_] := a[n] = n! Sum[(n - k + 1) a[k]/k!, {k, 0, n - 1}]; Table[a[n], {n, 0, 18}]
    nmax = 18; CoefficientList[Series[1/(2 - 1/(1 - x)^2), {x, 0, nmax}], x] Range[0, nmax]!
    Table[Sum[(-1)^(n - k) StirlingS1[n, k] 2^k HurwitzLerchPhi[1/2, -k, 0]/2, {k, 0, n}], {n, 0, 18}]
  • PARI
    my(x='x+O('x^25)); Vec(serlaplace(1 / (2 - 1 / (1 - x)^2))) \\ Michel Marcus, Jul 18 2021

Formula

E.g.f.: 1 / (2 - 1 / (1 - x)^2).
E.g.f.: 1 / (1 - Sum_{k>=1} (k+1) * x^k).
a(0) = 1, a(1) = 2, a(2) = 14; a(n) = 4 * n * a(n-1) - 2 * n * (n-1) * a(n-2).
a(n) = Sum_{k=0..n} (-1)^(n-k) * Stirling1(n,k) * 2^k * A000670(k).
a(n) = n! * A003480(n).

A346433 E.g.f.: 1 / (2 - exp(2*(exp(x) - 1))).

Original entry on oeis.org

1, 2, 14, 142, 1910, 32094, 647126, 15223198, 409276054, 12378827166, 416006542550, 15378483225758, 620176642174742, 27094392220198814, 1274759052849262422, 64259896197635471006, 3455259407744574799254, 197401403111903906001310, 11941074177046918285056470
Offset: 0

Views

Author

Ilya Gutkovskiy, Jul 17 2021

Keywords

Crossrefs

Programs

  • Mathematica
    nmax = 18; CoefficientList[Series[1/(2 - Exp[2 (Exp[x]- 1)]), {x, 0, nmax}], x] Range[0, nmax]!
    a[0] = 1; a[n_] := a[n] = Sum[Binomial[n, k] BellB[k, 2] a[n - k], {k, 1, n}]; Table[a[n], {n, 0, 18}]
    Table[Sum[StirlingS2[n, k] 2^k HurwitzLerchPhi[1/2, -k, 0]/2, {k, 0, n}], {n, 0, 18}]
  • PARI
    my(x='x+O('x^25)); Vec(serlaplace(1 / (2 - exp(2*(exp(x) - 1))))) \\ Michel Marcus, Jul 18 2021

Formula

a(0) = 1; a(n) = Sum_{k=1..n} binomial(n,k) * A001861(k) * a(n-k).
a(n) = Sum_{k=0..n} Stirling2(n,k) * 2^k * A000670(k).
a(n) ~ n! / (2*(2+log(2)) * (log(1+log(2)/2))^(n+1)). - Vaclav Kotesovec, Jul 27 2021
Showing 1-2 of 2 results.