login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A123088 a(1)=1. For n>=2, a(n) = n + (largest integer which is <= n and is missing from the earlier terms of the sequence). 2
1, 4, 6, 7, 10, 11, 12, 16, 18, 19, 20, 21, 26, 28, 30, 31, 34, 35, 36, 37, 38, 44, 46, 48, 50, 51, 54, 55, 58, 59, 60, 64, 66, 67, 68, 69, 70, 71, 78, 80, 82, 84, 86, 87, 90, 91, 94, 95, 98, 99, 100, 104, 106, 107, 108, 112, 114, 115, 116, 117, 122, 124, 126, 127, 130, 131 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
The largest integer which is <= 12 and does not occur among the first 11 terms of the sequence is 9. So a(12) = 12 + 9 = 21.
MATHEMATICA
f[l_List] := Block[{n = Length[l] + 1, k = n}, While[MemberQ[l, k], k-- ]; Append[l, n + k]]; Nest[f, {1}, 70] (* Ray Chandler, Sep 30 2006 *)
PROG
(PARI) {m=66; w=vector(2*m); print1(a=1, ", "); for(n=2, m, k=n; while(w[k], k--); print1(a=n+k, ", "); w[a]=1)} - (Klaus Brockhaus, Oct 05 2006)
CROSSREFS
Cf. A123679.
Sequence in context: A340847 A286494 A086170 * A256657 A189085 A153235
KEYWORD
nonn
AUTHOR
Leroy Quet, Sep 27 2006
EXTENSIONS
Extended by Ray Chandler and Klaus Brockhaus, Sep 30 2006
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)