A057983 These numbers take a record number of steps to reach the top of the deck in Guy's shuffle (see A035485).

1, 2, 3, 4, 7, 13, 15, 39, 43, 54, 1227, 1796, 2674, 3464, 6057, 7650, 17083

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