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!)
A345178 a(0) = 0, a(1) = 1; a(n+2) = Sum_{k=0..n} Stirling2(n,k) * a(k). 2

%I #7 Aug 13 2021 21:22:26

%S 0,1,0,1,1,2,8,38,194,1138,8154,71544,739406,8674238,113451160,

%T 1648133190,26631054962,478633871152,9531297220728,208851860234540,

%U 4997665703050398,129765874491438094,3639593254921626678,109942671192206473592,3569449102675488493032,124319448405579907085938

%N a(0) = 0, a(1) = 1; a(n+2) = Sum_{k=0..n} Stirling2(n,k) * a(k).

%H Alois P. Heinz, <a href="/A345178/b345178.txt">Table of n, a(n) for n = 0..355</a>

%p b:= proc(n, m) option remember; `if`(n=0,

%p a(m), m*b(n-1, m)+b(n-1, m+1))

%p end:

%p a:= n-> `if`(n<2, n, b(n-2, 0)):

%p seq(a(n), n=0..25); # _Alois P. Heinz_, Aug 13 2021

%t a[0] = 0; a[1] = 1; a[n_] := a[n] = Sum[StirlingS2[n - 2, k] a[k], {k, 0, n - 2}]; Table[a[n], {n, 0, 25}]

%t nmax = 25; A[_] = 0; Do[A[x_] = x + Normal[Integrate[Integrate[A[Exp[x] - 1 + O[x]^(nmax + 1)], x], x] + O[x]^(nmax + 1)], nmax]; CoefficientList[A[x], x] Range[0, nmax]!

%Y Cf. A000995, A003659, A007469, A345177.

%K nonn

%O 0,6

%A _Ilya Gutkovskiy_, Jun 10 2021

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 September 5 19:19 EDT 2024. Contains 375700 sequences. (Running on oeis4.)