|
%I #33 Nov 14 2019 17:20:08
%S 1,1,1,1,2,2,2,1,1,1,1,3,3,2,2,2,4,2,4,5,4,1,1,1,1,3,3,3,1,6,6,6,7,5,
%T 3,2,2,2,2,2,2,4,4,4,4,4,7,5,7,5,8,5,8,8,8,8,3,1,1,1,1,9,9,6,1,1,1,1,
%U 10,3,3,3,6,6,6,6,6,7,6,3,9,2,2,2,2,2,2
%N Lexicographically earliest sequence of positive integers such that for any n > 0 there are no more than a(n) numbers k > 0 such that a(n + k) = a(n + 2*k).
%C The sequence is well defined as we can always extend the sequence with a number that has not yet appeared.
%C The number 1 appears infinitely many times in the sequence:
%C - by contradiction: suppose that m is the index of the last occurrence of 1 in the sequence,
%C - there is no n > 0 such that n + k = m and n + 2*k = 2*m (with k > 0),
%C - so we can choose a(2*m) = 1, QED.
%C This sequence has connections with A003602:
%C - here we have up to a(n) numbers k such that a(n+k) = a(n+2*k), there we have no such numbers,
%C - for any v >= 0, let f_v be the lexicographically earliest sequence of positive integers such that there are no more than v numbers k such that f_v(n + k) = f_v(n + 2*k),
%C - then f_v corresponds to A003602 where all but the first term have been repeated 2*v+1 times.
%H Rémy Sigrist, <a href="/A309797/b309797.txt">Table of n, a(n) for n = 1..10000</a>
%H Rémy Sigrist, <a href="/A309797/a309797.gp.txt">PARI program for A309797</a>
%H Rémy Sigrist, <a href="/A309797/a309797.png">Scatterplot of the first 500000 terms</a>
%F a(n) >= #{ k>0 such that a(n+k) = a(n+2*k) }.
%e The first terms, alongside the corresponding k's, are:
%e n a(n) k's
%e -- ---- ----------
%e 1 1 {1}
%e 2 1 {1}
%e 3 1 {2}
%e 4 1 {1}
%e 5 2 {1, 3}
%e 6 2 {2, 14}
%e 7 2 {1, 2}
%e 8 1 {1}
%e 9 1 {1}
%e 10 1 {4}
%e 11 1 {1}
%e 12 3 {2, 3, 68}
%e 13 3 {1, 4, 22}
%e 14 2 {1, 2}
%o (PARI) See Links section.
%Y Cf. A003602, A329268 (positions of 1).
%K nonn,look
%O 1,5
%A _Rémy Sigrist_, Nov 11 2019
|
