Triangle read by rows: T(n,k) is the number of simple connected graphs on n nodes with diameter k (0<=k<n).

A294522

Triangle read by rows: T(n,k) is the number of simple connected graphs on n nodes with diameter k (0<=k<n).

Terms

    a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =0a(7) =1a(8) =4a(9) =1a(10) =0a(11) =1a(12) =14a(13) =5a(14) =1a(15) =0a(16) =1a(17) =59a(18) =43a(19) =8a(20) =1a(21) =0a(22) =1a(23) =373a(24) =387a(25) =82a(26) =9a(27) =1a(28) =0a(29) =1

External references