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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005693 Erroneous version of A321442.
(Formerly M0184)
1
2, 1, 30, 3, 29, 2, 4, 28, 2, 1, 3, 17, 4, 2, 12, 8, 2, 4, 9, 3, 28, 2, 11, 4, 2, 3, 3, 2, 8, 2, 10, 27, 2, 8, 10, 3, 3, 2, 4, 5, 2, 1, 3, 7, 4, 2, 9, 26, 2, 4, 7, 3, 9, 2, 7, 4, 2, 3, 3, 4, 97, 2, 8, 12, 2, 6, 4, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

These values taken from p. 263 of Guy paper. - Sean A. Irvine, Nov 09 2018

REFERENCES

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

LINKS

Table of n, a(n) for n=1..68.

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

Cf. A321442.

Sequence in context: A349037 A351710 A321442 * A158419 A074011 A054235

Adjacent sequences:  A005690 A005691 A005692 * A005694 A005695 A005696

KEYWORD

dead

AUTHOR

N. J. A. Sloane

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 17 14:02 EDT 2022. Contains 353746 sequences. (Running on oeis4.)