|
%I #11 Nov 23 2014 03:45:07
%S 0,2,5,7,18,33,51,53,75,77,103,105,135,137,171,174,176,218,220,266,
%T 268,318,320,374,376,434,436,498,500,567,637,639,713,715,793,795,877,
%U 879,965,967,1057,1059,1153,1155,1253,1255,1358,1465,1575,1577
%N From P-positions in a certain game.
%C Table 10 in Fraenkel is incorrect from n=6 onward. - _Nathaniel Johnston_, Apr 28 2011
%H Nathaniel Johnston, <a href="/A099357/b099357.txt">Table of n, a(n) for n = 0..10000</a>
%H A. S. Fraenkel, <a href="http://www.emis.de/journals/INTEGERS/papers/eg6/eg6.Abstract.html">New games related to old and new sequences</a>, INTEGERS, Electronic J. of Combinatorial Number Theory, Vol. 4, Paper G6, 2004.
%F See A099356.
%p a:=proc(n) option remember: local j, t: if(n=0)then return 0: else t:=a(n-1)+1: for j from 0 to n-1 do if(t=b(j))then return t+1: elif(t<b(j))then break: fi: od: return t: fi: end:
%p b:=proc(n) option remember: if(n=0)then return 0: else return b(n-1) + (-1)^a(n-1)*a(n-1) + a(n) + 1: fi: end:
%p seq(b(n), n=0..70); # _Nathaniel Johnston_, Apr 28 2011
%Y Cf. A099352 - A099356.
%K nonn,easy
%O 0,2
%A _N. J. A. Sloane_, Nov 16 2004
%E Edited and corrected by _Nathaniel Johnston_, Apr 28 2011
|
