Triangle read by rows: T(n,k) is the number of simple connected graphs on n nodes with longest path having k nodes, (1 <= k <= n).
A309524
Triangle read by rows: T(n,k) is the number of simple connected graphs on n nodes with longest path having k nodes, (1 <= k <= n).
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =0a(5) =2a(6) =0a(7) =0a(8) =1a(9) =5a(10) =0a(11) =0a(12) =1a(13) =2a(14) =18a(15) =0a(16) =0a(17) =1a(18) =3a(19) =17a(20) =91a(21) =0a(22) =0a(23) =1a(24) =3a(25) =29a(26) =86a(27) =734a(28) =0a(29) =0
External references
- oeis: A309524