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.
0, 1, 2, 4, 7, 10, 16, 22, 30, 38, 51, 65, 80, 101, 113, 139, 15
1 seqfan posts
Fri Oct 29 05:35:16 CEST 2010 [seqfan] Implementing first 500 sequences in Java