Number T(n,k) of permutations of [n] where the minimal cyclic distance between elements of the same cycle equals k (k=n for the identity permutation in S_n); triangle T(n,k), n>=0, 0<=k<=n, read by rows.
A277031
Number T(n,k) of permutations of [n] where the minimal cyclic distance between elements of the same cycle equals k (k=n for the identity permutation in S_n); triangle T(n,k), n>=0, 0<=k<=n, read by rows.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =0a(7) =5a(8) =0a(9) =1a(10) =0a(11) =20a(12) =3a(13) =0a(14) =1a(15) =0a(16) =109a(17) =10a(18) =0a(19) =0a(20) =1a(21) =0a(22) =668a(23) =44a(24) =7a(25) =0a(26) =0a(27) =1a(28) =0a(29) =4801
External references
- oeis: A277031