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”).
%I #20 Oct 05 2017 12:13:10
%S 4,6,12,32,94,534,2556,8062,35138,119094,293692,696532,1592106,
%T 3788448,10393730
%N Smallest stack size with an unentailed Grundy value of 2^n in Top Entails.
%C 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.
%C 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
%D Elwyn R. Berlekamp, John H. Conway and R. K. Guy, Winning Ways (for your mathematical plays), Academic Press (1982), pp. 376-379
%D Julian West, New Values for Top Entails, pp. 345-350 in Games of No Chance, edited Richard J. Nowakowski, Cambridge University Press (1996)
%Y Cf. A081176.
%K more,nonn
%O 0,1
%A _Christopher E. Thompson_, Apr 17 2003
%E a(14) from _David J. Seal_, Sep 12 2014