Triangle read by rows: T(n,k) is the number of unlabeled connected graphs with n nodes and packing chromatic number k, 1 <= k <= n.

A363044

Triangle read by rows: T(n,k) is the number of unlabeled connected graphs with n nodes and packing chromatic number k, 1 <= 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) =9a(13) =10a(14) =1a(15) =0a(16) =1a(17) =21a(18) =61a(19) =28a(20) =1a(21) =0a(22) =1a(23) =48a(24) =305a(25) =409a(26) =89a(27) =1a(28) =0a(29) =1

External references