|
|
A334546
|
|
Array read by antidiagonals: T(n,k) is the number of unlabeled connected loopless multigraphs with n nodes of degree k or less.
|
|
7
|
|
|
1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 2, 0, 0, 1, 1, 3, 2, 0, 0, 1, 1, 4, 4, 2, 0, 0, 1, 1, 5, 9, 12, 2, 0, 0, 1, 1, 6, 14, 37, 22, 2, 0, 0, 1, 1, 7, 23, 93, 146, 68, 2, 0, 0, 1, 1, 8, 32, 203, 602, 772, 166, 2, 0, 0, 1, 1, 9, 46, 399, 2126, 5847, 4449, 534, 2, 0, 0
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,13
|
|
COMMENTS
|
This sequence may be derived from A333893 by inverse Euler transform.
|
|
LINKS
|
|
|
FORMULA
|
Column k is the inverse Euler transform of column k of A333893.
|
|
EXAMPLE
|
Array begins:
==============================================
n\k | 0 1 2 3 4 5 6 7
----+-----------------------------------------
0 | 1 1 1 1 1 1 1 1 ...
1 | 1 1 1 1 1 1 1 1 ...
2 | 0 1 2 3 4 5 6 7 ...
3 | 0 0 2 4 9 14 23 32 ...
4 | 0 0 2 12 37 93 203 399 ...
5 | 0 0 2 22 146 602 2126 6308 ...
6 | 0 0 2 68 772 5847 34126 164965 ...
7 | 0 0 2 166 4449 66289 716141 6021463 ...
...
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|