Triangle read by rows: T(n,k) = number of cubic graphs with 2n nodes and packing chromatic number k (n>=2, 4 <= k <= n+2).

A275622

Triangle read by rows: T(n,k) = number of cubic graphs with 2n nodes and packing chromatic number k (n>=2, 4 <= k <= n+2).

Terms

    a(0) =1a(1) =1a(2) =1a(3) =0a(4) =3a(5) =2a(6) =0a(7) =3a(8) =15a(9) =1a(10) =0a(11) =7a(12) =42a(13) =36a(14) =0a(15) =0a(16) =13a(17) =252a(18) =222a(19) =22a(20) =0a(21) =34a(22) =907a(23) =2685a(24) =433a(25) =1a(26) =0a(27) =116a(28) =5277a(29) =21544

External references