Irregular triangle read by rows: T(n,k) is the number of connected permutation graphs on n vertices with domination number k, with 1 <= k <= floor(n/2).
A320583
Irregular triangle read by rows: T(n,k) is the number of connected permutation graphs on n vertices with domination number k, with 1 <= k <= floor(n/2).
Terms
- a(0) =1a(1) =1a(2) =3a(3) =10a(4) =3a(5) =43a(6) =28a(7) =223a(8) =236a(9) =2a(10) =1364a(11) =1842a(12) =62a(13) =9643a(14) =18433a(15) =1015a(16) =2a(17) =77545a(18) =181568a(19) =14146a(20) =84a(21) =699954a(22) =1938199a(23) =189077a(24) =2093a(25) =2
External references
- oeis: A320583