|
Search: id:A056207
|
|
|
| A056207 |
|
Number of binary trees of height <= n. |
|
+0
6
|
|
| 3, 24, 675, 458328, 210066388899, 44127887745906175987800, 1947270476915296449559703445493848930452791203, 37918623102659260828682350280278932773702331522473885847617341507177682544103411\ 75325352024
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
T. K. Moon, "Enumerations of binary trees, types of trees and the number of reversiblevariable length codes," submitted to Discrete Applied Mathematics, 2000.
|
|
FORMULA
|
a_n = d_n + a_{n-1} (d_n is the number of binary trees of depth exactly n, A001699).
a(n) = A003095(n+2)-2 = A004019(n+1)-1 = a(n-1)^2+4a(n-1)+3
|
|
CROSSREFS
|
Cf. A001699, A002449.
Sequence in context: A002832 A166736 A109055 this_sequence A075655 A000856 A047678
Adjacent sequences: A056204 A056205 A056206 this_sequence A056208 A056209 A056210
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Todd K. Moon (Todd.Moon(AT)ece.usu.edu), Aug 02 2000
|
|
EXTENSIONS
|
More terms from Henry Bottomley (se16(AT)btinternet.com), Jul 09 2001
|
|
|
Search completed in 0.002 seconds
|
