|
Search: id:A029758
|
|
| |
|
| 1, 1, 3, 15, 315, 108675, 11878720875, 141106591466142946875, 19911070158545297149037891328865229296875, 39645071485851304455281818836461083701971963604987697945684203361075660034179687\ 5
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
D. E. Knuth, Art of Computer Programming, Vol. 3, Sect. 6.2.3 (7) and (8).
|
|
LINKS
|
Index entries for sequences related to rooted trees
|
|
FORMULA
|
a(n+1)=a(n)^2+2*a(n)*a(n-1).
|
|
MAPLE
|
A029758 := proc(n) option remember; if n <= 1 then RETURN(1); else A029758(n-1)^2+2*A029758(n-1)*A029758(n-2); fi; end;
|
|
PROGRAM
|
(PARI) a(n)=if(n<2, n>=0, a(n-1)*(a(n-1)+2*a(n-2))) - Michael Somos Feb 07 2004
|
|
CROSSREFS
|
Cf. A029846.
Row sums of A143897. [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), Jun 01 2009]
Sequence in context: A070234 A036279 A156769 this_sequence A103031 A012474 A122579
Adjacent sequences: A029755 A029756 A029757 this_sequence A029759 A029760 A029761
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
D. E. Knuth
|
|
EXTENSIONS
|
More terms from N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
