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)).

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)).

Terms

    a(0) =1a(1) =0a(2) =1a(3) =0a(4) =2a(5) =0a(6) =6a(7) =0a(8) =19a(9) =2a(10) =0a(11) =83a(12) =29a(13) =0a(14) =500a(15) =353a(16) =0a(17) =4731a(18) =6386a(19) =0a(20) =75757a(21) =185323a(22) =0a(23) =2183854a(24) =9532714a(25) =3

External references