|
Search: id:A119649
|
|
|
| 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). |
|
+0
2
|
|
| 0, 1, 3, 12, 114, 1404, 22968, 456408, 10762992, 292851648, 9038285280, 311858347968, 11896746473088, 497156854363776, 22586083785232128, 1108320770197398528, 58420751739908940288, 3292054745517600648192, 197491129333671926863872, 12566253138627465234487296
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
The recurrence for A000311, with slightly different initial conditions.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n = 0..100
|
|
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: A127059 A068099 A032113 this_sequence A009254 A133987 A133553
Adjacent sequences: A119646 A119647 A119648 this_sequence A119650 A119651 A119652
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jul 30 2006
|
|
|
Search completed in 0.008 seconds
|
