%I
%S 2,6,7,8,9,12,18,24,30,31,32,36,37,38,39,40,41,42,43,44,45,46,47,48,
%T 49,50,51,52,53,54,60,66,67,68,69,72,78,84,90,96,102,108,114,120,126,
%U 132,138,144,150
%N a(1)=2; for n > 1, a(n) is the smallest integer greater than a(n1) consistent with the condition "n is in the sequence if and only if a(n) is congruent to 0 (mod 6)".
%D J.P. Allouche, N. Rampersad and J. Shallit, On integer sequences whose first iterates are linear, Aequationes Math. 69 (2005), 114127
%H B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL6/Cloitre/cloitre2.html">Numerical analogues of Aronson's sequence</a>, J. Integer Seqs., Vol. 6 (2003), #03.2.2.
%H B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="http://arXiv.org/abs/math.NT/0305308">Numerical analogues of Aronson's sequence</a> (math.NT/0305308)
%H <a href="/index/Aa#aan">Index entries for sequences of the a(a(n)) = 2n family</a>
%Y Cf. A079000.
%K nonn
%O 1,1
%A Benoit Cloitre, Feb 23 2003
