This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
Each row lists the integers that encode the games with the same value as the initial term of the row: 0,8,16,24,64,72,80,88,128,136,144,152,192,200,208,... 1,17,65,81,513,529,577,593,2049,2065,2113,2129,2561,... 2,10,130,138,514,522,642,650,2050,2058,2178,2186,... 3,11,19,27,515,523,531,539,2051,2059,2067,2075,2563,... 4,5,20,21,68,69,84,85,4100,4101,4116,4117,4164,4165,... 6,7,14,15,22,23,30,31,70,71,78,79,86,87,94,95,518,... 9,25,73,89,521,537,585,601,2057,2073,2121,2137,2569,... 12,13,28,29,76,77,92,93,524,525,540,541,588,589,604,... 18,26,146,154,530,538,658,666,2066,2074,2194,2202,... 32,34,40,42,160,162,168,170,544,546,552,554,672,674,... 33,35,41,43,49,51,57,59,161,163,169,171,177,179,185,... 36,37,38,39,44,45,46,47,52,53,54,55,60,61,62,63,100,... 48,50,56,58,176,178,184,186,560,562,568,570,688,690,... 66,74,82,90,194,202,210,218,578,586,594,602,706,714,...
A(4,5) = A(5,4) = 1 because 5 encodes the game {0,1|}, where, because the option 1 dominates the option 0 on the left side, the zero can be deleted, resulting the game {1|}, the canonical form of the game 2, which is encoded as 4.
25 (= 2^(2*2) + 2^(2*0) + 2^(1+2*1)) encodes the game {-1,0|1}, where, as the option -1 is dominated by option 0, the former can be deleted, giving us the game {0|1}, i.e. the canonical (minimal) form of the game 1/2, encoded as 2^(2*0) + 2^(1+2*1) = 9, thus a(25)=9 and a(9)=9. Similarly a(65536)=1, as 65536 (= 2^(2*(2^(1+2*1)))) encodes the game {{|1}|}, which is reversible to the game {0|}, i.e. the game 1, which is encoded as 2^(2*0) = 1.
Comments