Triangle T(n,k) (n >= 1, 0 <= k <= n-1) read by rows: number of distinct permutations after k steps of the "first transposition" algorithm.
A345462
Triangle T(n,k) (n >= 1, 0 <= k <= n-1) read by rows: number of distinct permutations after k steps of the "first transposition" algorithm.
Terms
- a(0) =1a(1) =2a(2) =1a(3) =6a(4) =3a(5) =1a(6) =24a(7) =13a(8) =4a(9) =1a(10) =120a(11) =67a(12) =23a(13) =5a(14) =1a(15) =720a(16) =411a(17) =146a(18) =36a(19) =6a(20) =1a(21) =5040a(22) =2921a(23) =1067a(24) =272a(25) =52a(26) =7a(27) =1a(28) =40320a(29) =23633
External references
- oeis: A345462