|
|
A352067
|
|
Triangle read by rows: T(n,k) is the number of connected graphs with n nodes and degeneracy k, 0 <= k < n.
|
|
2
|
|
|
1, 0, 1, 0, 1, 1, 0, 2, 3, 1, 0, 3, 13, 4, 1, 0, 6, 62, 37, 6, 1, 0, 11, 364, 393, 77, 7, 1, 0, 23, 2799, 6485, 1665, 135, 9, 1, 0, 47, 27811, 158766, 68957, 5268, 220, 10, 1, 0, 106, 349306, 5718805, 5091421, 541593, 14997, 330, 12, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,8
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
n\k| 0 1 2 3 4 5 6 7 8 9
---+----------------------------------------------------
1 | 1
2 | 0 1
3 | 0 1 1
4 | 0 2 3 1
5 | 0 3 13 4 1
6 | 0 6 62 37 6 1
7 | 0 11 364 393 77 7 1
8 | 0 23 2799 6485 1665 135 9 1
9 | 0 47 27811 158766 68957 5268 220 10 1
10 | 0 106 349306 5718805 5091421 541593 14997 330 12 1
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|