Irregular triangle read by rows: T(n,k) is the number of simple connected graphs on n nodes with radius k, (0 <= k <= floor(n/2)).
A324239
Irregular triangle read by rows: T(n,k) is the number of simple connected graphs on n nodes with radius k, (0 <= k <= floor(n/2)).
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =2a(5) =0a(6) =4a(7) =2a(8) =0a(9) =11a(10) =10a(11) =0a(12) =34a(13) =76a(14) =2a(15) =0a(16) =156a(17) =682a(18) =15a(19) =0a(20) =1044a(21) =9864a(22) =207a(23) =2a(24) =0a(25) =12346a(26) =245518a(27) =3197a(28) =19a(29) =0
External references
- oeis: A324239