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

A115597

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

Terms

    a(0) =1a(1) =1a(2) =2a(3) =1a(4) =3a(5) =6a(6) =1a(7) =4a(8) =16a(9) =12a(10) =1a(11) =5a(12) =31a(13) =84a(14) =34a(15) =1a(16) =6a(17) =52a(18) =318a(19) =579a(20) =87a(21) =1a(22) =7a(23) =81a(24) =867a(25) =5366a(26) =5721a(27) =302a(28) =1a(29) =8

External references