cp's OEIS Frontend

A307669 Lexicographically earliest sequence of positive terms, such that each value, say v, appears five times at indices k, k + v, k + 2*v, k + 3*v and k + 4*v for some k.

%I A307669 #11 Apr 23 2019 02:14:31
%S A307669 1,1,1,1,1,2,4,2,8,2,4,2,9,2,4,10,8,3,4,14,3,9,4,3,8,10,3,11,13,3,9,
%T A307669 19,8,14,12,10,15,20,11,9,8,13,17,21,24,10,12,14,9,11,19,15,26,30,13,
%U A307669 10,23,20,12,17,11,14,25,28,21,29,15,13,24,19,12,11,18
%N A307669 Lexicographically earliest sequence of positive terms, such that each value, say v, appears five times at indices k, k + v, k + 2*v, k + 3*v and k + 4*v for some k.
%C A307669 This sequence is a variant of A307664.
%C A307669 Graphically, we have five chaotic lines.
%C A307669 Apparently every positive integer appears in the sequence.
%H A307669 Rémy Sigrist, <a href="/A307669/b307669.txt">Table of n, a(n) for n = 1..10000</a>
%H A307669 Rémy Sigrist, <a href="/A307669/a307669.png">Colored scatterplot of the first 250000 terms</a> (where the color is based on the ordinal transform of the sequence)
%H A307669 Rémy Sigrist, <a href="/A307669/a307669.gp.txt">PARI program for A307669</a>
%e A307669 For n = 1:
%e A307669 - we can set a(1) = a(2) = a(3) = a(4) = a(5) = 1.
%e A307669 For n = 6:
%e A307669 - we can set a(6) = a(8) = a(10) = a(12) = a(14) = 2.
%e A307669 For n = 7:
%e A307669 - a(10) is already known, hence a(7) <> 3,
%e A307669 - we can set a(7) = a(11) = a(15) = a(19) = a(23) = 4.
%o A307669 (PARI) See Links section.
%Y A307669 Cf. A026242, A307664.
%K A307669 nonn
%O A307669 1,6
%A A307669 _Rémy Sigrist_, Apr 20 2019