A005693 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A005693

Erroneous version of A321442.
(Formerly M0184)

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.