|
|
A006223
|
|
Number of binary rooted trees of height n requiring 3 registers.
(Formerly M4940)
|
|
1
|
|
|
1, 14, 118, 780, 4466, 23276, 113620, 528840, 2375100, 10378056, 44381832, 186574864, 773564328, 3171317360, 12880883408, 51915526432, 207893871472, 827983736608
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
7,2
|
|
COMMENTS
|
The eighteen listed terms a(7)...a(24) satisfy a(n) = 14a(n-1) - 78a(n-2) + 220a(n-3) - 330a(n-4) + 252a(n-5) - 84a(n-6) + 8a(n-7) for n>7 (taking a(1), a(2), ..., a(6) = 0). - John W. Layman, Oct 14 1999
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
MAPLE
|
A006223:=-1/(2*z-1)/(2*z**4-16*z**3+20*z**2-8*z+1)/(2*z**2-4*z+1); # conjectured (correctly) by Simon Plouffe in his 1992 dissertation
|
|
MATHEMATICA
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|