|
Search: id:A000376
|
|
|
| A000376 |
|
Topswops (2): shuffle n cards labeled 1..n. If top card is m, reverse order of top m cards. Repeat until 1 gets to top, then stop. Suppose the whole deck is now sorted (if not, discard this case). a(n) is the maximal number of steps before 1 got to the top. |
|
+0
2
|
|
| 1, 2, 4, 7, 10, 16, 22, 30, 38, 51, 63, 80, 101, 112, 130, 159
(list; graph; listen)
|
|
|
Search completed in 0.002 seconds
|
