cp's OEIS Frontend

A079351 a(1)=3; for n > 1, a(n) is the smallest integer greater than a(n-1) consistent with the condition "n is in the sequence if and only if a(n) is congruent to 0 (mod 5)".

%I A079351 #14 Aug 22 2025 04:29:32
%S A079351 3,4,5,10,15,16,17,18,19,20,21,22,23,24,25,30,35,40,45,50,55,60,65,70,
%T A079351 75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,
%U A079351 98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115
%N A079351 a(1)=3; for n > 1, a(n) is the smallest integer greater than a(n-1) consistent with the condition "n is in the sequence if and only if a(n) is congruent to 0 (mod 5)".
%C A079351 Equivalently: unique monotonic sequence satisfying a(1)=3, a(a(n))=5n.
%H A079351 Benoit Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="http://www.cs.uwaterloo.ca/journals/JIS/index.html">Numerical analogues of Aronson's sequence</a>, J. Integer Seqs., Vol. 6 (2003), #03.2.2.
%H A079351 Benoit Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="https://arxiv.org/abs/math/0305308">Numerical analogues of Aronson's sequence</a>, arXiv:math/0305308 [math.NT], 2003.
%H A079351 <a href="/index/Aa#aan">Index entries for sequences of the a(a(n)) = 2n family</a>
%F A079351 a(3*5^k + j) = 5^(k+1) + 3j + 2|j|, k >= 0, -2*5^k <= j < 2*5^k.
%Y A079351 Cf. A079000, A080589, A003605.
%K A079351 nonn,changed
%O A079351 1,1
%A A079351 _Benoit Cloitre_, Feb 23 2003
%E A079351 More terms from _Matthew Vandermast_, Mar 13 2003