|
| |
|
|
A369279
|
|
Triangle read by rows: T(n,k) is the number of simple graphs on n unlabeled nodes with cooling number k = 1..n.
|
|
2
|
|
|
|
1, 0, 2, 0, 2, 2, 0, 3, 6, 2, 0, 3, 22, 7, 2, 0, 4, 102, 41, 7, 2, 0, 4, 661, 322, 48, 7, 2, 0, 5, 7606, 4238, 439, 49, 7, 2, 0, 5, 169021, 98708, 6396, 480, 49, 7, 2, 0, 6, 7555003, 4282954, 159359, 7301, 487, 49, 7, 2
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,3
|
|
|
LINKS
|
|
|
|
EXAMPLE
|
Triangle begins:
1;
0, 2;
0, 2, 2;
0, 3, 6, 2;
0, 3, 22, 7, 2;
0, 4, 102, 41, 7, 2;
0, 4, 661, 322, 48, 7, 2;
0, 5, 7606, 4238, 439, 49, 7, 2;
0, 5, 169021, 98708, 6396, 480, 49, 7, 2;
0, 6, 7555003, 4282954, 159359, 7301, 487, 49, 7, 2;
...
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
