login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A037988 Critical values in Conway's game of one-dimensional phutball. 4
1, 3, 4, 7, 9, 10, 11, 15, 16, 19, 21, 23, 24, 25, 26, 31, 33, 34, 35, 39, 40, 43, 44, 47, 49, 51, 53, 54, 55, 56, 57, 63, 64, 67, 69, 71, 72, 73, 74, 79, 81, 82, 83, 87, 89, 90, 91, 95, 96, 99, 100, 103, 104, 107, 109, 111, 113, 115, 116 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

The first player can move the ball 2a_n spaces before the second player can move the ball 2(a_{n-1}+1) spaces

A self-describing sequence. Pick any number n; this n says: "There are n terms in the sequence which are <= 2n". This sequence is the slowest increasing one with this property. - Eric Angelini, Jun 15 2007

REFERENCES

Berlekamp, Conway and Guy, "Winning Ways", Volume 2. Academic Press, 1982

LINKS

Table of n, a(n) for n=0..58.

CROSSREFS

Sequence in context: A010435 A057709 A139442 * A213508 A088958 A300061

Adjacent sequences:  A037985 A037986 A037987 * A037989 A037990 A037991

KEYWORD

easy,nonn

AUTHOR

Erich Friedman

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 15 20:00 EST 2019. Contains 330000 sequences. (Running on oeis4.)