OFFSET
0,2
COMMENTS
At n-th step, pick up top n cards and interlace them with the next n.
Here is the deck after steps 0,1,2,3,4,5:
1,2,3,4,5,6,7,...
2,1,3,4,5,6,7,...
3,2,4,1,5,6,7,...
1,3,5,2,6,4,7,8,9,...
6,1,4,3,7,5,8,2,9,10,...
It is conjectured that eventually every number appears on top of the deck.
See A035491 for (the relevant part of) the deck after the n-th step. - M. F. Hasler, Aug 13 2022
REFERENCES
D. Gale, Mathematical Entertainments: "Careful Card-Shuffling and Cutting Can Create Chaos," The Mathematical Intelligencer, vol. 14, no. 1, 1992, pages 54-56.
D. Gale, Tracking the Automatic Ant and Other Mathematical Explorations, A Collection of Mathematical Entertainments Columns from The Mathematical Intelligencer, Springer, 1998.
LINKS
Lars Blomberg, Table of n, a(n) for n = 0..10000
Eric Weisstein's World of Mathematics, Perfect Shuffle.
FORMULA
a(n) = A035491(n,1), i.e., the first element of the n-th row of that table, for all n > 0. - M. F. Hasler, Aug 13 2022
PROG
(Python)
def aupton(terms):
alst, deck = [1], list(range(1, 2*terms+1))
for n in range(1, terms+1):
first, next = deck[:n], deck[n:2*n]
deck[0:2*n:2] = next
deck[1:2*n:2] = first
alst.append(deck[0])
return alst
print(aupton(83)) # Michael S. Branicky, Feb 01 2021
CROSSREFS
KEYWORD
nonn,easy,nice
AUTHOR
EXTENSIONS
More terms from Jud McCranie
STATUS
approved