The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A057983 These numbers take a record number of steps to reach the top of the deck in Guy's shuffle (see A035485). 6
 1, 2, 3, 4, 7, 13, 15, 39, 43, 54, 1227, 1796, 2674, 3464, 6057, 7650, 17083 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS See A057984 for the number of steps for these to reach the top of the deck. REFERENCES D. Gale, Tracking the Automatic Ant and Other Mathematical Explorations, Springer, 1998, chapter 5. D. Gale, Mathematical Entertainments: "Careful Card-Shuffling and Cutting Can Create Chaos," The Mathematical Intelligencer, vol. 14, no. 1, 1992, pages 54-56. LINKS Table of n, a(n) for n=0..16. EXAMPLE In Guy's shuffle, 4 takes 8 shuffles to reach the top, no smaller number takes more shuffles, so 4 is in the sequence. CROSSREFS Cf. A035485, A035490, A035493, A035494, A057984, A060750-A060752. A057984 = A035490(A057983). Sequence in context: A285222 A023162 A022437 * A200088 A004783 A031149 Adjacent sequences: A057980 A057981 A057982 * A057984 A057985 A057986 KEYWORD hard,nonn AUTHOR Jud McCranie, Oct 24 2000 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.

Last modified April 22 22:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)