Triangle read by rows: T(n,k) (n>=2, k=0..n-1) gives number of biconnected graphs on n nodes with chromatic number n-k.

A126749

Triangle read by rows: T(n,k) (n>=2, k=0..n-1) gives number of biconnected graphs on n nodes with chromatic number n-k.

Terms

    a(0) =0a(1) =1a(2) =0a(3) =1a(4) =1a(5) =1a(6) =1a(7) =2a(8) =6a(9) =1a(10) =1a(11) =3a(12) =17a(13) =30a(14) =5a(15) =1a(16) =4a(17) =34a(18) =189a(19) =232a(20) =8a(21) =1a(22) =5a(23) =59a(24) =627a(25) =3627a(26) =2762a(27) =42a(28) =1a(29) =6

External references