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!)
A026350 a(n) = a(m) if a(m) has already occurred exactly once and n = a(m)+m-1, else a(n) = least positive integer that has not yet occurred. 5
1, 2, 2, 3, 4, 3, 5, 4, 6, 7, 5, 8, 9, 6, 10, 7, 11, 12, 8, 13, 9, 14, 15, 10, 16, 17, 11, 18, 12, 19, 20, 13, 21, 22, 14, 23, 15, 24, 25, 16, 26, 17, 27, 28, 18, 29, 30, 19, 31, 20, 32, 33, 21, 34, 22, 35, 36, 23, 37, 38, 24, 39, 25, 40, 41, 26 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n+1)=A026242(n)+1, for all n>0. - M. F. Hasler, Sep 17 2014
PROG
(PARI) A026350=vector(#A026242+1, n, if(n>1, A026242[n-1])+1) \\ Assumes the vector A026242 is defined, cf. there for PARI code. - M. F. Hasler, Sep 17 2014
CROSSREFS
Cf. A026272.
Sequence in context: A026254 A091525 A091524 * A205002 A370929 A355029
KEYWORD
nonn
AUTHOR
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 May 6 02:22 EDT 2024. Contains 372290 sequences. (Running on oeis4.)