The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A029900 f(n) where strategic move on f(n) X 3 rectangle in Chomp is (n,1). 2


%S 1,3,4,6,8,10,11,13,15,16,18,20,21,24,25,27,28,30,32,34,35,37,39,40,

%T 42,44,45,48,49,51,53,54,56,57,59,60,63,64,66,68,70,72,73,74,76,78,80,

%U 82,83,85,87,89,88,92,93,95,96,98,100,102,104,105,107,109,111

%N f(n) where strategic move on f(n) X 3 rectangle in Chomp is (n,1).

%D E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning Ways vol. 2, 598-600.

%D M. Gardner, Mathematical Games, Sci. Amer. (Jan, May 1973).

%H A. E. Brouwer, <a href="http://www.win.tue.nl/~aeb/games/chomp.html">Chomp</a>

%Y See also A029899 - A029905.

%K nonn

%O 0,2

%A _Fred Lunnon_

%E More terms from _Sean A. Irvine_, Mar 08 2020

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 October 24 08:15 EDT 2021. Contains 348217 sequences. (Running on oeis4.)