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

A343263 a(0) = 1; a(n+1) = exp(-a(n)) * Sum_{k>=0} a(n)^k * k^n / k!.

Original entry on oeis.org

1, 1, 1, 2, 22, 301554, 2493675105669492542968967478
Offset: 0

Views

Author

Ilya Gutkovskiy, Apr 09 2021

Keywords

Comments

The next term is too large to include.

Crossrefs

Programs

  • Mathematica
    a[0] = 1; a[n_] := a[n] = Sum[StirlingS2[n - 1, k] a[n - 1]^k, {k, 0, n - 1}]; Table[a[n], {n, 0, 6}]
    a[0] = 1; a[n_] := a[n] = BellB[n - 1, a[n - 1]]; Table[a[n], {n, 0, 6}]

Formula

a(0) = 1; a(n+1) = n! * [x^n] exp(a(n) * (exp(x) - 1)).
a(0) = 1; a(n+1) = Sum_{k=0..n} Stirling2(n,k) * a(n)^k.
Showing 1-1 of 1 results.