A263322 Triangle read by rows: T(n,k) is the number of simple graphs with n unlabeled vertices and burning number k.

1, 0, 2, 0, 3, 1, 0, 8, 2, 1, 0, 23, 9, 1, 1, 0, 94, 56, 4, 1, 1, 0, 534, 494, 11, 3, 1, 1, 0, 4887, 7401, 43, 10, 3, 1, 1, 0, 76801, 197605, 213, 35, 9, 3, 1, 1, 0, 2196200, 9807208, 1547, 165, 34, 9, 3, 1, 1

Offset

1,3

Links

Table of n, a(n) for n=1..55.

FindStat - Combinatorial Statistic Finder, The burning number of a graph.

Eric Weisstein's World of Mathematics, Burning Number.

Eric Weisstein's World of Mathematics, Simple Graph.

Example

Triangle begins:
  1;
  0,       2;
  0,       3,       1;
  0,       8,       2,    1;
  0,      23,       9,    1,   1;
  0,      94,      56,    4,   1,  1;
  0,     534,     494,   11,   3,  1, 1;
  0,    4887,    7401,   43,  10,  3, 1, 1;
  0,   76801,  197605,  213,  35,  9, 3, 1, 1;
  0, 2196200, 9807208, 1547, 165, 34, 9, 3, 1, 1;
  ...

Crossrefs

Rows sums are A000088.

Cf. A369278 (counts for connected graphs), A369279 (cooling number).

Sequence in context: A299070 A209599 A238347 * A353496 A170942 A325660

Adjacent sequences: A263319 A263320 A263321 * A263323 A263324 A263325

Keyword

nonn,tabl,more

Author

Christian Stump, Oct 14 2015

Extensions

Merged with near duplicate by Andrew Howroyd, Mar 11 2024

Status

approved