This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A035501 #15 Aug 11 2022 14:48:28 %S A035501 0,1,2,4,6,10,14,19,20,21,22,30,46,52,62,72,76,85,94,120,126,144,147, %T A035501 169,174,190,216,221,241,251,254,273,281,289,292,300,301,305,308,323, %U A035501 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 %N A035501 Shuffles at which new record high cards appear on top of deck in Guy's shuffling problem A035485. %D A035501 D. Gale, Mathematical Entertainments: "Careful Card-Shuffling and Cutting Can Create Chaos," Mathematical Intelligencer, vol. 14, no. 1, 1992, pages 54-56. %D A035501 D. Gale, Tracking the Automatic Ant and Other Mathematical Explorations, A Collection of Mathematical Entertainments Columns from The Mathematical Intelligencer, Springer, 1998. %o A035501 (Python) %o A035501 from itertools import count, islice %o A035501 def agen(): # generator of terms %o A035501 deck = []; record = 1; yield 0 %o A035501 for n in count(1): %o A035501 deck += [2*n-1, 2*n] %o A035501 first, next = deck[:n], deck[n:2*n] %o A035501 deck[0:2*n:2], deck[1:2*n:2] = next, first %o A035501 if deck[0] > record: record = deck[0]; yield n %o A035501 print(list(islice(agen(), 66))) # _Michael S. Branicky_, Aug 11 2022 %Y A035501 Cf. A035485, A035493, A035494, A035501. %K A035501 nonn %O A035501 1,3 %A A035501 _N. J. A. Sloane_, _Wouter Meeussen_ %E A035501 More terms from _Jud McCranie_