Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A057983
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A057983 These numbers take a record number of steps to reach the top of the deck in Guy's shuffle (see A035485). +0
6
1, 2, 3, 4, 7, 13, 15, 39, 43, 54, 1227, 1796, 2674, 3464, 6057, 7650, 17083 (list; graph; listen)
OFFSET

0,2

COMMENT

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.

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: A152605 A023162 A022437 this_sequence A096723 A137495 A099779

Adjacent sequences: A057980 A057981 A057982 this_sequence A057984 A057985 A057986

KEYWORD

hard,nonn

AUTHOR

Jud McCranie (j.mccranie(AT)comcast.net), Oct 24 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research