login

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”).

A081198
Smallest stack size with an unentailed Grundy value of 2^n in Top Entails.
1
4, 6, 12, 32, 94, 534, 2556, 8062, 35138, 119094, 293692, 696532, 1592106, 3788448, 10393730
OFFSET
0,1
COMMENTS
Values above 600000 (i.e. for n >= 11) were computed by David J. Seal (personal communication) and have not yet (April 2003) been independently confirmed.
Another term added from computations beyond 4100000, up to 22000000 (September 2014). Like those between 600000 and 4100000 reported by Christopher E. Thompson, these have not yet been independently confirmed. Computations done by David J. Seal, Sep 12 2014
REFERENCES
Elwyn R. Berlekamp, John H. Conway and R. K. Guy, Winning Ways (for your mathematical plays), Academic Press (1982), pp. 376-379
Julian West, New Values for Top Entails, pp. 345-350 in Games of No Chance, edited Richard J. Nowakowski, Cambridge University Press (1996)
CROSSREFS
Cf. A081176.
Sequence in context: A027070 A087785 A366772 * A275978 A242211 A073167
KEYWORD
more,nonn
AUTHOR
EXTENSIONS
a(14) from David J. Seal, Sep 12 2014
STATUS
approved