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!)
A214371 If a(n) has not yet been defined then set a(n) = least positive integer that has not yet occurred; also if n>1 and a(n+a(n)) has not yet been defined then set a(n+a(n)) = a(n). 1
1, 2, 3, 2, 4, 3, 5, 6, 4, 7, 8, 5, 4, 6, 9, 10, 7, 11, 8, 6, 12, 13, 14, 9, 15, 10, 8, 16, 11, 17, 18, 19, 12, 20, 13, 10, 14, 21, 22, 15, 23, 24, 25, 16, 12, 10, 17, 13, 18, 26, 19, 27, 28, 20, 15, 10, 12, 29, 21, 16, 22, 30, 31, 23, 32, 24, 18, 25, 12, 19, 33 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..71.

FORMULA

a(1)=1, for n>1, a(n) = A214370(n-1)+1.

MATHEMATICA

mex[a_]:=Module[{q}, q=1; While[MemberQ[a, q] , q++]; q];  a = Table[0, {k, 1, 100]}]; For[n=1, n<=100, n++, {If[a[[n]]==0, a[[n]] = mex[a]]; If[n>1, {nan = n+a[[n]]; If[(nan <= Length[a]) && (a[[nan]] == 0), a[[nan]] = a[[n]]]}]; }]; a

PROG

(Python)

SIZE = 300

a = [-8]*SIZE

top=0

for n in range(SIZE):

    if a[n]==-8:       # if a[n] is undefined yet

        top+=1

        a[n]=top

    if 1<n+a[n]<SIZE and a[n+a[n]]==-8:   # if a[n+a[n]] is undefined yet

        a[n+a[n]]=a[n]

    print(a[n], end=', ')

CROSSREFS

Cf. A214370.

Cf. A026242, A026338.

Sequence in context: A336215 A243290 A085238 * A026338 A026242 A130526

Adjacent sequences:  A214368 A214369 A214370 * A214372 A214373 A214374

KEYWORD

nonn,easy

AUTHOR

Alex Ratushnyak, Jul 14 2012

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 July 25 03:31 EDT 2021. Contains 346282 sequences. (Running on oeis4.)