The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035501 Shuffles at which new record high cards appear on top of deck in Guy's shuffling problem A035485. 3
0, 1, 2, 4, 6, 10, 14, 19, 20, 21, 22, 30, 46, 52, 62, 72, 76, 85, 94, 120, 126, 144, 147, 169, 174, 190, 216, 221, 241, 251, 254, 273, 281, 289, 292, 300, 301, 305, 308, 323, 338, 341, 379, 382, 399, 421, 429, 447, 448, 449, 473, 479, 490, 509, 510, 544, 561, 583, 588, 615, 632, 651, 686, 715, 726, 764 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
REFERENCES
D. Gale, Mathematical Entertainments: "Careful Card-Shuffling and Cutting Can Create Chaos," 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
PROG
(Python)
from itertools import count, islice
def agen(): # generator of terms
deck = []; record = 1; yield 0
for n in count(1):
deck += [2*n-1, 2*n]
first, next = deck[:n], deck[n:2*n]
deck[0:2*n:2], deck[1:2*n:2] = next, first
if deck[0] > record: record = deck[0]; yield n
print(list(islice(agen(), 66))) # Michael S. Branicky, Aug 11 2022
CROSSREFS
Sequence in context: A309882 A098380 A007782 * A024204 A036641 A260732
KEYWORD
nonn
AUTHOR
EXTENSIONS
More terms from Jud McCranie
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 13 08:41 EDT 2024. Contains 372498 sequences. (Running on oeis4.)