Triangle read by rows: T(n,k) is the number of k-colored connected graphs on n labeled nodes up to permutation of the colors.
A322278
Triangle read by rows: T(n,k) is the number of k-colored connected graphs on n labeled nodes up to permutation of the colors.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =3a(5) =4a(6) =0a(7) =19a(8) =84a(9) =38a(10) =0a(11) =195a(12) =2470a(13) =3140a(14) =728a(15) =0a(16) =3031a(17) =108390a(18) =307390a(19) =186360a(20) =26704a(21) =0a(22) =67263a(23) =7192444a(24) =42747460a(25) =52630060a(26) =18926544a(27) =1866256a(28) =0a(29) =2086099
External references
- oeis: A322278