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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A099352 From P-positions in a certain game. 4
0, 1, 3, 4, 5, 6, 8, 9, 10, 11, 13, 14, 15, 16, 17, 19, 20, 21, 22, 23, 24, 26, 27, 28, 29, 30, 31, 32, 33, 34, 36, 37, 38, 39, 40, 41, 42, 43, 44, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 69, 70, 71, 72, 73, 74, 75 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Nathaniel Johnston, Table of n, a(n) for n = 0..10000

A. S. Fraenkel, New games related to old and new sequences, INTEGERS, Electronic J. of Combinatorial Number Theory, Vol. 4, Paper G6, 2004.

FORMULA

Let a(n) = this sequence, b(n) = A099353. Then a(n) = the smallest number not in {a(0), b(0), a(1), b(1), ..., a(n-1), b(n-1)}; b(n) = b(n-1) + a(n) - floor((a(n-1)+1)/a(n)) + 2. Apart from initial zero, this is the complement of A099353.

MAPLE

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:

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(a(n), n=0..70); # Nathaniel Johnston, Apr 28 2011

CROSSREFS

Cf. A099353.

Sequence in context: A110911 A103202 A188040 * A047207 A266728 A039132

Adjacent sequences:  A099349 A099350 A099351 * A099353 A099354 A099355

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, Nov 16 2004

STATUS

approved

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 28 14:58 EDT 2020. Contains 333089 sequences. (Running on oeis4.)