A321442 - 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

A321442

Length of Beanstalk game.

2, 1, 30, 3, 21, 2, 4, 20, 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, 81, 2, 8, 12, 2, 6, 4, 3, 3, 2, 4, 22, 2, 26, 3, 11, 4, 2

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

These values computed independently by Sean A. Irvine and David Consiglio, Jr. based on the description of the game in the Guy paper. The values differ in some places from those given on p. 263 of the paper.

LINKS

Sean A. Irvine, Table of n, a(n) for n = 1..500

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.

Sean A. Irvine, Standalone Java implementation

CROSSREFS

Cf. A005693.

Sequence in context: A245621 A349037 A351710 * A005693 A158419 A074011

Adjacent sequences: A321439 A321440 A321441 * A321443 A321444 A321445

KEYWORD

nonn

AUTHOR

Sean A. Irvine and David Consiglio, Jr., Nov 09 2018

STATUS

approved