# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a369278 Showing 1-1 of 1 %I A369278 #17 Mar 11 2024 23:13:03 %S A369278 1,0,1,0,2,0,6,0,19,2,0,83,29,0,500,353,0,4731,6386,0,75757,185323,0, %T A369278 2183854,9532714,3 %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)). %H A369278 Eric Weisstein's World of Mathematics, Burning Number. %H A369278 Eric Weisstein's World of Mathematics, Connected Graph. %e A369278 Triangle begins: %e A369278 1; %e A369278 0, 1; %e A369278 0, 2 %e A369278 0, 6 %e A369278 0, 19, 2; %e A369278 0, 83, 29; %e A369278 0, 500, 353; %e A369278 0, 4731, 6386; %e A369278 0, 75757, 185323; %e A369278 0, 2183854, 9532714, 3; %e A369278 ... %Y A369278 Row sums are A001349. %Y A369278 Cf. A263322 (counts for all simple graphs), A369280 (cooling number). %K A369278 nonn,tabf,more %O A369278 1,5 %A A369278 _Eric W. Weisstein_, Jan 18 2024 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE