Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005692
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005692 Shortest wins at Beanstalk.
(Formerly M4328)
+0
1
0, 7, 5, 65, 11, 63, 9, 17, 61, 69, 7, 15, 59, 23, 67, 93, 31, 13, 57, 57, 21, 65, 21, 91, 29, 73, 11, 55, 11, 55, 19, 63, 63, 19, 45, 89, 27, 27, 71, 27, 53, 53, 9, 35, 53, 79, 17, 61, 61, 61, 17, 43, 61 (list; graph; listen)
OFFSET

0,2

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

R. K. Guy, John Isbell's game of beanstalk and John Conway's game of beans-don't-talk. Math. Mag. 59 (1986), no. 5, 259-269.

CROSSREFS

Sequence in context: A089244 A063003 A038271 this_sequence A080798 A007553 A002019

Adjacent sequences: A005689 A005690 A005691 this_sequence A005693 A005694 A005695

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 December 5 17:24 EST 2009. Contains 170342 sequences.


AT&T Labs Research