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

A084269

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

Terms

    a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =0a(7) =3a(8) =2a(9) =1a(10) =0a(11) =5a(12) =12a(13) =3a(14) =1a(15) =0a(16) =17a(17) =64a(18) =26a(19) =4a(20) =1a(21) =0a(22) =44a(23) =475a(24) =282a(25) =46a(26) =5a(27) =1a(28) =0a(29) =182

External references