Triangle read by rows: T(n,k) (n>=1, 1 <= k <= n) = number of permutations of [1..n] in which none of the cycle lengths are divisible by k.

A213280

Triangle read by rows: T(n,k) (n>=1, 1 <= k <= n) = number of permutations of [1..n] in which none of the cycle lengths are divisible by k.

Terms

    a(0) =0a(1) =0a(2) =1a(3) =0a(4) =3a(5) =4a(6) =0a(7) =9a(8) =16a(9) =18a(10) =0a(11) =45a(12) =80a(13) =90a(14) =96a(15) =0a(16) =225a(17) =400a(18) =540a(19) =576a(20) =600a(21) =0a(22) =1575a(23) =2800a(24) =3780a(25) =4032a(26) =4200a(27) =4320a(28) =0a(29) =11025

External references