|
Search: id:A065329
|
|
|
| A065329 |
|
Square array read by antidiagonals giving number of binary trees of height n with k points on the n-th level (n,k>0). |
|
+0
4
|
|
| 1, 0, 2, 0, 1, 8, 0, 0, 8, 80, 0, 0, 4, 144, 4160, 0, 0, 1, 168, 13888, 5632640, 0, 0, 0, 138, 31776, 36109952, 5163215782400, 0, 0, 0, 80, 54792, 158572864, 64827181969920
(list; table; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
LINKS
|
H. Bottomley, Illustration of initial terms
|
|
FORMULA
|
T(n, k)=Sum_j{2j >= k}[C(2j, k)*T(n-1, j)] starting with T(1, 1)=1 and T(1, k)=0 if k>1
|
|
EXAMPLE
|
Rows start (1,0,0,...), (2,1,0,0,...), (8,8,4,1,0,0,...), (80,144,168,138,80,32,8,1,0,0,...) etc.
|
|
CROSSREFS
|
Row sums are A001699. Cf. A073345 (A073429).
Sequence in context: A114329 A101371 A078341 this_sequence A108998 A055141 A055140
Adjacent sequences: A065326 A065327 A065328 this_sequence A065330 A065331 A065332
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Henry Bottomley (se16(AT)btinternet.com), Oct 29 2001
|
|
|
Search completed in 0.002 seconds
|
