%I #15 Mar 19 2018 06:28:56
%S 1,0,0,0,1,2,2,2,1,4,4,0,1,0,6,2,1,2,4,2,1,0,4,5,1,6,6,5,1,2,4,5,1,0,
%T 6,5,3,0,4,5,3,0,1,5,3,0,6,5,3,0,8,5,4,0,6,7,6,0,3,5,4,0,1,5,6,2,1,3,
%U 4,0,1,0,4,2,1,7,4,7,3,0,4,5,1,8,6,2,3,0,4,5,4,0,1,2,3,10,3,7,3,0,9,5,8,5
%N Sprague-Grundy values for octal game .106.
%C This sequence has a (minimal) period of 328226140474 and a minimal preperiod of 465384263797. The maximal depth is bounded by 15343, so it is sufficient to store (at most) the last 15343+3 values and of course the 15 sparse values and their positions. The last exceptional value is g(465384263796) = 25. - _Achim Flammenkamp_, May 21 2002
%D E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning Ways, Academic Press, NY, 2 vols., 1982; see Chapter 4.
%H Eric M. Schmidt, <a href="/A071458/b071458.txt">Table of n, a(n) for n = 1..10000</a>
%H Achim Flammenkamp, <a href="http://www.uni-bielefeld.de/~achim/octal_sparse.html">Octal games</a>
%K nonn
%O 1,6
%A _N. J. A. Sloane_ and _Sue Pope_, May 29 2002
%E Edited and extended by _Christian G. Bower_, Nov 11 2002
|