Square array read by antidiagonals: T(n,k) is the number of simple labeled graphs G with vertex set V(G) = {v_1,...,v_n} along with a (coloring) function C:V(G) ->[k] such that v_i adjacent to v_j implies C(v_i) != C(v_j) and i<j implies C(v_i) <= C(v_j); n>=0, k>=0.
A337161
Square array read by antidiagonals: T(n,k) is the number of simple labeled graphs G with vertex set V(G) = {v_1,...,v_n} along with a (coloring) function C:V(G) ->[k] such that v_i adjacent to v_j implies C(v_i) != C(v_j) and i<j implies C(v_i) <= C(v_j); n>=0, k>=0.
Terms
- a(0) =1a(1) =1a(2) =0a(3) =1a(4) =1a(5) =0a(6) =1a(7) =2a(8) =1a(9) =0a(10) =1a(11) =3a(12) =4a(13) =1a(14) =0a(15) =1a(16) =4a(17) =9a(18) =10a(19) =1a(20) =0a(21) =1a(22) =5a(23) =16a(24) =35a(25) =34a(26) =1a(27) =0a(28) =1a(29) =6
External references
- oeis: A337161