|
|
A370772
|
|
Triangle read by rows: T(n,k) is the number of k-trees with n unlabeled nodes rooted at a hedron.
|
|
3
|
|
|
0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 3, 1, 1, 0, 1, 6, 3, 1, 1, 0, 1, 16, 10, 3, 1, 1, 0, 1, 37, 39, 10, 3, 1, 1, 0, 1, 96, 164, 48, 10, 3, 1, 1, 0, 1, 239, 746, 253, 48, 10, 3, 1, 1, 0, 1, 622, 3474, 1584, 273, 48, 10, 3, 1, 1, 0, 1, 1607, 16658, 10500, 1913, 273, 48, 10, 3, 1, 1, 0
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,12
|
|
COMMENTS
|
A hedron is a (k+1)-clique.
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
0;
1, 0;
1, 1, 0;
1, 1, 1, 0;
1, 3, 1, 1, 0;
1, 6, 3, 1, 1, 0;
1, 16, 10, 3, 1, 1, 0;
1, 37, 39, 10, 3, 1, 1, 0;
1, 96, 164, 48, 10, 3, 1, 1, 0;
1, 239, 746, 253, 48, 10, 3, 1, 1, 0;
1, 622, 3474, 1584, 273, 48, 10, 3, 1, 1, 0;
...
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|