Topswops (1): start by shuffling n cards labeled 1..n. If top card is m, reverse order of top m cards, then repeat. a(n) is the maximal number of steps before top card is 1.
A000375
Topswops (1): start by shuffling n cards labeled 1..n. If top card is m, reverse order of top m cards, then repeat. a(n) is the maximal number of steps before top card is 1.
Terms
- a(0) =0a(1) =1a(2) =2a(3) =4a(4) =7a(5) =10a(6) =16a(7) =22a(8) =30a(9) =38a(10) =51a(11) =65a(12) =80a(13) =101a(14) =113a(15) =139a(16) =159a(17) =191a(18) =221
External references
- oeis: A000375