The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A094173 a(n) = m if m has already occurred at least once and n=k+i*(m+1) where k is the index of the first occurrence of n and i=1,...,max(n-1,1), otherwise a(n) = least positive integer that has not yet occurred. 1
1, 2, 1, 3, 2, 4, 5, 3, 6, 7, 4, 3, 5, 8, 9 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Is the sequence possible for all n?
a(16) does not exist: it would have to be 4 (since a(6) = a(11) = 4 and so a(6 + 2*(4 + 1)) = a(16) = 4) and also 6 (since a(9) = 6 and so a(9 + 1*(6 + 1)) = a(16) = 6) simultaneously. - Herman Jamke (hermanjamke(AT)fastmail.fm), May 01 2008
LINKS
CROSSREFS
Sequence in context: A174618 A365006 A144241 * A214370 A227859 A026272
KEYWORD
nonn,fini,full
AUTHOR
Amarnath Murthy, Jun 01 2004
EXTENSIONS
Edited by Herman Jamke (hermanjamke(AT)fastmail.fm), May 01 2008
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 28 12:36 EDT 2024. Contains 372913 sequences. (Running on oeis4.)