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

A324244

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

Terms

    a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =0a(7) =2a(8) =2a(9) =2a(10) =0a(11) =5a(12) =4a(13) =7a(14) =5a(15) =0a(16) =25a(17) =20a(18) =16a(19) =23a(20) =28a(21) =0a(22) =185a(23) =146a(24) =119a(25) =57a(26) =123a(27) =223a(28) =0a(29) =2459

External references