The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A099353 From P-positions in a certain game. 3


%S 0,2,7,12,18,25,35,45,56,68,83,98,114,131,149,170,191,213,236,260,285,

%T 313,341,370,400,431,463,496,530,565,603,641,680,720,761,803,846,890,

%U 935,983,1031,1080,1130,1181,1233,1286,1340,1395,1451,1510,1569

%N From P-positions in a certain game.

%H Nathaniel Johnston, <a href="/A099353/b099353.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 A099352.

%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) + a(n) - floor((a(n-1)+1)/a(n)) + 2: fi: end:seq(b(n),n=0..50); # _Nathaniel Johnston_, Apr 28 2011

%K nonn,easy

%O 0,2

%A _N. J. A. Sloane_, Nov 16 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 5 15:57 EST 2021. Contains 341825 sequences. (Running on oeis4.)