A005692 - OEIS

A005692

Shortest wins at Beanstalk.
(Formerly M4328)

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; refs; listen; history; text; internal format)

OFFSET

0,2

COMMENTS

a(n) gives the shortest win for the game Beanstalk when starting with 2*n+1. - Sean A. Irvine, Aug 06 2016

REFERENCES

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

LINKS

Sean A. Irvine, Table of n, a(n) for n = 0..999

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: A063003 A038271 A329008 * A080798 A007553 A294474

Adjacent sequences: A005689 A005690 A005691 * A005693 A005694 A005695

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

STATUS

approved