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!)
A097342 a(n) = Sum_{k=0..floor(n/2)} Stirling2(n-k,k) * 3^k. 7
1, 0, 3, 3, 12, 30, 93, 300, 1038, 3810, 14781, 60375, 258807, 1160949, 5435652, 26502555, 134282406, 705720549, 3840542031, 21608662710, 125523530724, 751831408929, 4637611255422, 29428408797852, 191907975348210 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n)=sum{k=0..floor(n/2), sum{i=0..k, (-1)^(k+i)i^(n-k)/(i!(k-i)!)}3^k }
G.f.: Sum_{k>=0} 3^k * x^(2*k)/Product_{j=1..k} (1 - j * x). - Seiichi Manyama, Apr 09 2022
MATHEMATICA
Table[Sum[StirlingS2[n-k, k]3^k, {k, 0, Floor[n/2]}], {n, 0, 30}] (* Harvey P. Dale, May 24 2012 *)
PROG
(PARI) my(N=40, x='x+O('x^N)); Vec(sum(k=0, N, 3^k*x^(2*k)/prod(j=1, k, 1-j*x))) \\ Seiichi Manyama, Apr 09 2022
(PARI) a(n) = sum(k=0, n\2, 3^k*stirling(n-k, k, 2)); \\ Seiichi Manyama, Apr 09 2022
CROSSREFS
Sequence in context: A192307 A328150 A161804 * A370145 A025236 A014432
KEYWORD
easy,nonn
AUTHOR
Paul Barry, Aug 05 2004
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 17 23:23 EDT 2024. Contains 371767 sequences. (Running on oeis4.)