Triangle read by rows: T(n,k) = number of graphs on n node with edge chromatic number k (n >= 1, k >= 1).
A123962
Triangle read by rows: T(n,k) = number of graphs on n node with edge chromatic number k (n >= 1, k >= 1).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =1a(7) =1a(8) =2a(9) =3a(10) =5a(11) =1a(12) =2a(13) =5a(14) =14a(15) =10a(16) =2a(17) =1a(18) =3a(19) =10a(20) =46a(21) =58a(22) =38a(23) =1a(24) =3a(25) =15a(26) =123a(27) =347a(28) =392a(29) =159
External references
- oeis: A123962