login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A343263 a(0) = 1; a(n+1) = exp(-a(n)) * Sum_{k>=0} a(n)^k * k^n / k!. 0
1, 1, 1, 2, 22, 301554, 2493675105669492542968967478 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
The next term is too large to include.
LINKS
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.
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}]
CROSSREFS
Sequence in context: A246852 A060601 A053952 * A261198 A052077 A124604
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Apr 09 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)