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!)
A029901 g(n), where strategic move on g(n) X 3 rectangle in Chomp is (h(n),2). 2


%S 2,5,7,9,12,14,17,19,22,23,26,29,31,33,36,38,41,43,46,47,50,52,55,58,

%T 61,62,65,67,69,71,75,77,79,81,84,86,90,91,94,97,99,101,103,106,108,

%U 110,114,115,119,120,123,126,127,131,132,135,137,140,142,145,147

%N g(n), where strategic move on g(n) X 3 rectangle in Chomp is (h(n),2).

%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,1

%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 11:34 EDT 2021. Contains 348225 sequences. (Running on oeis4.)