Triangle read by rows: T(n,k) (n>=0, k=0..n) gives number of connected graphs on n nodes with edge chromatic number k.
A126732
Triangle read by rows: T(n,k) (n>=0, k=0..n) gives number of connected graphs on n nodes with edge chromatic number k.
Terms
- a(0) =1a(1) =1a(2) =0a(3) =0a(4) =1a(5) =0a(6) =0a(7) =0a(8) =1a(9) =1a(10) =0a(11) =0a(12) =2a(13) =4a(14) =0a(15) =0a(16) =0a(17) =1a(18) =8a(19) =10a(20) =2a(21) =0a(22) =0a(23) =2a(24) =26a(25) =48a(26) =36a(27) =0a(28) =0a(29) =0
External references
- oeis: A126732