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 A024542 #8 Jul 15 2019 22:19:04 %S A024542 0,1,1,1,1,2,2,2,2,3,3,4,4,4,4,4,4,5,6,6,6,6,7,7,8,8,8,9,9,10,7,7,8,8, %T A024542 11,11,12,12,12,12,12,12,11,12,14,14,15,15,16,16,14,14,17,18,17,17,15, %U A024542 15,19,20,20,20,13,13,13,14,22,22,22,22,23,23,18,18,24,24,25,25,26,26 %N A024542 Lower bound on cumulative mean of distances between cards after n shuffles in A024222. %D A024542 Martin Gardner, "Card Shuffles," Mathematical Carnival, chapter 10, pages 123-138. New York: Vintage Books, 1977. %D A024542 Tim Folger, "Shuffling Into Hyperspace," Discover, 1991 (vol 12, no 1), pages 66-67. %H A024542 Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a024/A024542.java">Java program</a> (github) %e A024542 a(6)=2. Without cut, after shuffle 1 (s1), order is 4 1 5 2 6 3; after s2, 2 4 6 1 3 5; after s3, 1 2 3 4 5 6. Mean distances between cards after s1 = 3.4 (17/5), s2 = 2.6 (13/5), s3 = 1 (5/5). 35/15=2.3, cumulative mean distance, so lower bound is 2. (Cuts change number of shuffles required to return cards to original order, in this case from 3 to 4.) %Y A024542 Cf. A024222. %K A024542 easy,nonn %O A024542 1,6 %A A024542 _Enoch Haga_