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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A100795 n occurs n times, as early as possible subject to the constraint that no two successive terms are identical. 5
 1, 2, 3, 2, 3, 4, 3, 4, 5, 4, 5, 4, 5, 6, 5, 6, 5, 6, 7, 6, 7, 6, 7, 6, 7, 8, 7, 8, 7, 8, 7, 8, 9, 8, 9, 8, 9, 8, 9, 8, 9, 10, 9, 10, 9, 10, 9, 10, 9, 10, 11, 10, 11, 10, 11, 10, 11, 10, 11, 10, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 13, 12, 13, 12, 13, 12, 13, 12, 13, 12, 13, 12 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Permutation of A002024. - Reinhard Zumkeller, Jan 17 2014 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 EXAMPLE After a(8) = 4 the next term is 5 as 3 has already occurred three times. PROG (Haskell) a100795 n = a100795_list !! (n-1) a100795_list = f 0 a002024_list where f x ws = v : f v (us ++ vs) where (us, v:vs) = span (== x) ws -- Reinhard Zumkeller, Jan 17 2014 CROSSREFS Cf. A061925, A074148, A100798. Sequence in context: A199323 A156549 A275868 * A045781 A045670 A194960 Adjacent sequences: A100792 A100793 A100794 * A100796 A100797 A100798 KEYWORD easy,nonn AUTHOR Amarnath Murthy, Dec 05 2004 EXTENSIONS Corrected and extended by Ray Chandler, Dec 08 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 3 09:50 EST 2022. Contains 358517 sequences. (Running on oeis4.)