Number of permutations of length n that can be sorted in 2^(n-1)-1 steps of Elizalde and Winkler's homing algorithm.
A173469
Number of permutations of length n that can be sorted in 2^(n-1)-1 steps of Elizalde and Winkler's homing algorithm.
Terms
- a(0) =1a(1) =2a(2) =5a(3) =16a(4) =62a(5) =280a(6) =1440a(7) =8296a(8) =52864a(9) =368848a(10) =2794864a(11) =22842048a(12) =200201408a(13) =1872466944a(14) =18608903968a(15) =195778297664
External references
- oeis: A173469