Triangle read by rows: T(n,k) (n>=2, k=2..n) gives number of connected graphs on n nodes with chromatic number n-k+1.
A126736
Triangle read by rows: T(n,k) (n>=2, k=2..n) gives number of connected graphs on n nodes with chromatic number n-k+1.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =3a(6) =1a(7) =3a(8) =12a(9) =5a(10) =1a(11) =4a(12) =26a(13) =64a(14) =17a(15) =1a(16) =5a(17) =46a(18) =282a(19) =475a(20) =44a(21) =1a(22) =6a(23) =74a(24) =809a(25) =5009a(26) =5036a(27) =182a(28) =1a(29) =7
External references
- oeis: A126736