The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A323420 Lexicographically earliest sequence of positive integers such that for any n > 0, a(n + a(n)) > a(n). 1
 1, 2, 1, 3, 1, 2, 4, 3, 1, 2, 5, 3, 1, 2, 4, 6, 1, 2, 5, 3, 1, 7, 4, 6, 1, 2, 5, 3, 8, 7, 4, 6, 1, 2, 5, 3, 9, 7, 4, 6, 1, 2, 5, 3, 8, 10, 4, 6, 1, 2, 5, 3, 9, 7, 4, 11, 1, 2, 5, 3, 8, 10, 4, 6, 1, 2, 12, 3, 9, 7, 4, 11, 1, 2, 5, 3, 8, 10, 13, 6, 1, 2, 12, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Every positive integer appears in the sequence. Empirically: - for any n > 0, the least d > 0 such that a(n) = a(n+d) is a power of 2 (see scatterplot in Links section), - the run-length transform of the first differences of the positions of the 1's in the sequence corresponds to A055010 (excluding the leading 0). LINKS Rémy Sigrist, Table of n, a(n) for n = 1..10000 Rémy Sigrist, Colored scatterplot of the first 100000 terms (where the color is function of the least d > 0 such that a(n) = a(n+d)) FORMULA a(A000124(n)) = n + 1 for any n >= 0. EXAMPLE a(1) = 1, hence a(1 + a(1)) = a(2) > 1. a(2) = 2, hence a(2 + a(2)) = a(4) > 2. a(3) = 1, hence a(3 + a(1)) = a(4) > 1. a(4) = 3, etc. PROG (PARI) a = vector(84, n, 1); for (n=1, #a, print1 (a[n] ", "); nan = n+a[n]; if (nan <= #a, a[nan] = max(a[nan], 1+a[n]))) CROSSREFS Cf. A000124, A055010. Sequence in context: A212121 A213371 A125047 * A331296 A270656 A045898 Adjacent sequences:  A323417 A323418 A323419 * A323421 A323422 A323423 KEYWORD nonn AUTHOR Rémy Sigrist, Aug 30 2019 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 November 26 21:07 EST 2021. Contains 349344 sequences. (Running on oeis4.)