%I #11 Mar 30 2012 17:27:18
%S 5,7,8,9,12,13,18,24,30,31,32,36,42,43,44,45,46,48,49,50,51,52,53,54,
%T 55,56,57,58,59,60,66,72,73,74,75,78,79,80,81,82,83,84,90,96,102,108,
%U 109,114,120,126,132,138,144,150,156,162,168,174,180,186,187,188,189,190
%N a(1) = 5; for n>1, a(n) is taken to be the smallest integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is divisible by 6".
%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>
%F {a(a(n))} = {6i, i >= 2}.
%Y Cf. A080639, A080640, A079000.
%K nonn,easy
%O 1,1
%A _N. J. A. Sloane_ and Benoit Cloitre, Feb 28 2003
%E More terms from _Matthew Vandermast_, Mar 13 2003