login
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
OFFSET
1,5
LINKS
Eric Weisstein's World of Mathematics, Burning Number.
Eric Weisstein's World of Mathematics, Connected Graph.
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
Row sums are A001349.
Cf. A263322 (counts for all simple graphs), A369280 (cooling number).
Sequence in context: A296620 A263789 A081153 * A126869 A094233 A094659
KEYWORD
nonn,tabf,more
AUTHOR
Eric W. Weisstein, Jan 18 2024
STATUS
approved