Triangle T(n,k) (n >= 1, 0 <= k <= n-1) read by rows: number of distinct permutations after k steps of the "optimist" algorithm.

A345461

Triangle T(n,k) (n >= 1, 0 <= k <= n-1) read by rows: number of distinct permutations after k steps of the "optimist" algorithm.

Terms

    a(0) =1a(1) =2a(2) =1a(3) =6a(4) =1a(5) =1a(6) =24a(7) =6a(8) =1a(9) =1a(10) =120a(11) =38a(12) =7a(13) =1a(14) =1a(15) =720a(16) =232a(17) =53a(18) =7a(19) =1a(20) =1a(21) =5040a(22) =1607a(23) =404a(24) =74a(25) =7a(26) =1a(27) =1a(28) =40320a(29) =12984

External references