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.
%I A053398 #10 Aug 04 2014 08:24:40 %S A053398 0,1,1,0,1,0,2,2,2,2,0,2,0,2,0,1,1,2,2,1,1,0,1,0,2,0,1,0,3,3,3,3,3,3, %T A053398 3,3,0,3,0,3,0,3,0,3,0,1,1,3,3,1,1,3,3,1,1,0,1,0,3,0,1,0,3,0,1,0,2,2, %U A053398 2,2,3,3,3,3,2,2,2,2,0,2,0,2,0,3,0,3,0,2,0,2,0,1,1,2,2,1,1,3,3,1,1,2,2,1,1 %N A053398 Nim-values from game of Kopper's Nim. %C A053398 Rows/columns 1-10 are A007814, A050603, A053399, A053384-A053890. %C A053398 Comment from R. K. Guy: David Singmaster (zingmast(AT)sbu.ac.uk) sent me, about 5 years ago, a game he'd received from Bodo Koppers. It is played with two heaps of beans. The move is to remove one heap and split the other into two nonempty heaps. I'm not sure if Koppers invented it, or got it from elsewhere. I do not think that he analyzed it, but Singmaster did. %H A053398 Reinhard Zumkeller, <a href="/A053398/b053398.txt">Rows n = 1..125 of triangle, flattened</a> %F A053398 a(x, y) = place of last zero bit of (x-1) OR (y-1). %F A053398 T(n,k) = A007814(A003986(n-1,k-1)+1). - _Reinhard Zumkeller_, Aug 04 2014 %o A053398 (Haskell) %o A053398 a053398 :: Int -> Int -> Int %o A053398 a053398 n k = a007814 $ a003986 (n - 1) (k - 1) + 1 %o A053398 a053398_row n = map (a053398 n) [1..n] %o A053398 a053398_tabl = map a053398_row [1..] %o A053398 -- _Reinhard Zumkeller_, Aug 04 2014 %Y A053398 Cf. A007814, A050603, A053399, A053384-A053890. %Y A053398 Cf. A003986, A007814 (both edges & central terms & minima per row), A000523 (max per row), A245836 (row sums), A003987, A051775. %K A053398 nonn,tabl,easy,nice %O A053398 1,7 %A A053398 _David W. Wilson_