login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A119649
a(0)=0, a(1)=1; for n >= 1, a(n+1) = (n+2)*a(n) + 2*Sum_{k=2..n-1} binomial(n, k)*a(k)*a(n-k+1).
2
0, 1, 3, 12, 114, 1404, 22968, 456408, 10762992, 292851648, 9038285280, 311858347968, 11896746473088, 497156854363776, 22586083785232128, 1108320770197398528, 58420751739908940288, 3292054745517600648192, 197491129333671926863872, 12566253138627465234487296
OFFSET
0,3
COMMENTS
The recurrence for A000311, with slightly different initial conditions.
MAPLE
M:=50; a:=array(0..100); a[0]:=0; a[1]:=1; lprint(0, a[0]); lprint(1, a[1]); for n from 1 to M do a[n+1]:=(n+2)*a[n]+2*add(binomial(n, k)*a[k]*a[n-k+1], k=2..n-1); lprint(n+1, a[n+1]); od:
CROSSREFS
Cf. A000311.
Sequence in context: A224818 A032113 A352637 * A308144 A320257 A350410
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jul 30 2006
STATUS
approved