|
|
A176463
|
|
Irregular triangle read by rows: T(n,k) = number of Huffman-equivalence classes of ternary trees with 3n+1 leaves and 4k leaves on the bottom level (n>=1, k>=1).
|
|
3
|
|
|
1, 1, 1, 1, 2, 1, 1, 4, 2, 1, 1, 8, 4, 2, 1, 15, 8, 4, 2, 29, 15, 8, 4, 1, 57, 29, 15, 8, 2, 1, 112, 57, 29, 15, 4, 2, 1, 220, 112, 57, 29, 7, 4, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
1
1
1 1
2 1 1
4 2 1 1
8 4 2 1
15 8 4 2
29 15 8 4 1
57 29 15 8 2 1
112 57 29 15 4 2 1
220 112 57 29 7 4 2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|