Triangle of optimist numbers T(n,k) (n >= 1, 0 <= k <= n-1) read by rows: permutations needing k steps to be sorted by the "optimist" algorithm.

A345453

Triangle of optimist numbers T(n,k) (n >= 1, 0 <= k <= n-1) read by rows: permutations needing k steps to be sorted by the "optimist" algorithm.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =5a(5) =0a(6) =1a(7) =17a(8) =6a(9) =0a(10) =1a(11) =49a(12) =64a(13) =6a(14) =0a(15) =1a(16) =129a(17) =432a(18) =150a(19) =8a(20) =0a(21) =1a(22) =321a(23) =2356a(24) =2016a(25) =336a(26) =10a(27) =0a(28) =1a(29) =769

External references