The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS 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: A068099 A224818 A032113 * A308144 A320257 A009254 Adjacent sequences:  A119646 A119647 A119648 * A119650 A119651 A119652 KEYWORD nonn AUTHOR N. J. A. Sloane, Jul 30 2006 STATUS approved

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

Last modified February 18 15:30 EST 2020. Contains 332019 sequences. (Running on oeis4.)