A126011 A106486-encodings for the minimal representatives of each equivalence class of the finite combinatorial games.
0, 1, 2, 3, 4, 6, 9, 12, 18, 32, 33, 36, 48, 66, 67, 96, 97, 129, 131, 132, 134, 195, 256, 258, 264, 288, 384, 386, 516, 768, 4098, 4099, 4102, 4128, 4129, 4132, 4227, 4230, 8196, 8198, 8204, 8448, 8450, 8456, 12294, 262146, 262152, 262176, 262272
Offset: 0
Keywords
References
- E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning Ways, Second Edition, Vol. 1, A K Peters, 2001.
- John H. Conway, On Numbers and Games, Second Edition, A K Peters, 2001.
Links
- A. Karttunen, Table of n, a(n) for n = 0..73
- D. Eppstein, Combinatorial Game Theory links
- A. Karttunen, Scheme-program for computing this sequence.
- A. Siegel, Combinatorial Game Suite
- Wikipedia, Combinatorial game theory
- D. Wolfe, Several publications about combinatorial game theory
Crossrefs
Extensions
Table of terms added Jan 01 2007.
Comments