|
|
A370770
|
|
Triangle read by rows: T(n,k) is the number of k-trees with n unlabeled nodes.
|
|
11
|
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 6, 5, 2, 1, 1, 1, 1, 11, 12, 5, 2, 1, 1, 1, 1, 23, 39, 15, 5, 2, 1, 1, 1, 1, 47, 136, 58, 15, 5, 2, 1, 1, 1, 1, 106, 529, 275, 64, 15, 5, 2, 1, 1, 1, 1, 235, 2171, 1505, 331, 64, 15, 5, 2, 1, 1, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,12
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
Triangle begins:
1;
1, 1;
1, 1, 1;
1, 1, 1, 1;
1, 2, 1, 1, 1;
1, 3, 2, 1, 1, 1;
1, 6, 5, 2, 1, 1, 1;
1, 11, 12, 5, 2, 1, 1, 1;
1, 23, 39, 15, 5, 2, 1, 1, 1;
1, 47, 136, 58, 15, 5, 2, 1, 1, 1;
1, 106, 529, 275, 64, 15, 5, 2, 1, 1, 1;
...
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|