cp's OEIS Frontend

A336268 Lexicographically earliest sequence of positive integers such that for any term, say k, there are k occurrences of k in the sequence, and the distance between any two consecutive occurrences of k equals k.

%I A336268 #11 Jul 19 2020 04:06:57
%S A336268 1,2,3,2,5,3,7,8,3,5,11,17,13,7,5,8,28,36,4,5,7,11,4,8,5,13,4,7,17,54,
%T A336268 4,8,11,42,7,72,56,30,13,8,70,7,40,11,28,17,60,8,7,90,140,13,84,36,11,
%U A336268 8,150,126,80,108,105,10,17,8,13,11,120,30,280,168
%N A336268 Lexicographically earliest sequence of positive integers such that for any term, say k, there are k occurrences of k in the sequence, and the distance between any two consecutive occurrences of k equals k.
%C A336268 This sequence is a variant of A336215.
%C A336268 Will every integer appear in this sequence?
%H A336268 Rémy Sigrist, <a href="/A336268/b336268.txt">Table of n, a(n) for n = 1..5000</a>
%H A336268 Rémy Sigrist, <a href="/A336268/a336268.txt">C++ program for A336268</a>
%e A336268 For n = 1:
%e A336268 - we can choose a(1) = 1.
%e A336268 For n = 2:
%e A336268 - we can choose a(2) = 2,
%e A336268 - consequently: a(4) = 2.
%e A336268 - For n = 3:
%e A336268 - we can choose a(3) = 3,
%e A336268 - consequently: a(6) = a(9) = 3.
%e A336268 For n = 5:
%e A336268 - a(5) cannot be equal to 4 as a(9) = 3,
%e A336268 - we can choose a(5) = 5,
%e A336268 - consequently: a(10) = a(15) = a(20) = a(<25) = 5.
%o A336268 (C++) See Links section.
%Y A336268 Cf. A336215.
%K A336268 nonn
%O A336268 1,2
%A A336268 _Rémy Sigrist_, Jul 15 2020