This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A111439 Variation of Golomb's sequence: a(n) is the number of times n appears with a(n) unequal to a(n-1). 1
 1, 2, 3, 2, 3, 4, 3, 4, 5, 6, 5, 6, 5, 6, 7, 6, 7, 8, 7, 8, 9, 8, 9, 8, 9, 10, 9, 10, 9, 10, 11, 10, 11, 10, 11, 10, 11, 12, 11, 12, 13, 12, 13, 12, 13, 12, 13, 12, 13, 14, 15, 14, 15, 14, 15, 14, 15, 14, 15, 14, 15, 16, 15, 16, 17, 16, 17, 16, 17 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(n) is understood to be the smallest number >=a(n-2) fitting the description. LINKS Rémy Sigrist, Table of n, a(n) for n = 1..10000 PROG (PARI) r = vector(69, k, -1); p = 0; for (i=1, #r, v = 1; while (v==p || r[v]==0, v++); r[i]=v; r[v]--; print1 (v ", "); p=v); \\ Rémy Sigrist, Jan 28 2017 CROSSREFS Bisections: A080606 and A080605. Cf. A001462 (Golomb's sequence). Sequence in context: A045781 A045670 A194960 * A020986 A095161 A072106 Adjacent sequences:  A111436 A111437 A111438 * A111440 A111441 A111442 KEYWORD nonn AUTHOR Floor van Lamoen, Nov 14 2005 EXTENSIONS Offset corrected by Rémy Sigrist, Jan 28 2017 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.

Last modified October 15 03:16 EDT 2019. Contains 328025 sequences. (Running on oeis4.)