|
|
A369278
|
|
Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with burning number k = 1..ceiling(sqrt(n)).
|
|
2
|
|
|
1, 0, 1, 0, 2, 0, 6, 0, 19, 2, 0, 83, 29, 0, 500, 353, 0, 4731, 6386, 0, 75757, 185323, 0, 2183854, 9532714, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
1;
0, 1;
0, 2
0, 6
0, 19, 2;
0, 83, 29;
0, 500, 353;
0, 4731, 6386;
0, 75757, 185323;
0, 2183854, 9532714, 3;
...
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|