Triangle read by rows: T(n,k) is the number of uniquely colorable simple graphs on n nodes with chromatic number k = 1..n.

A369227

Triangle read by rows: T(n,k) is the number of uniquely colorable simple graphs on n nodes with chromatic number k = 1..n.

Terms

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

External references