

A080780


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)".


0



2, 6, 7, 8, 9, 12, 18, 24, 30, 31, 32, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 60, 66, 67, 68, 69, 72, 78, 84, 90, 96, 102, 108, 114, 120, 126, 132, 138, 144, 150
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


REFERENCES

J.P. Allouche, N. Rampersad and J. Shallit, On integer sequences whose first iterates are linear, Aequationes Math. 69 (2005), 114127


LINKS

Table of n, a(n) for n=1..49.
B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, J. Integer Seqs., Vol. 6 (2003), #03.2.2.
B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence (math.NT/0305308)
Index entries for sequences of the a(a(n)) = 2n family


CROSSREFS

Cf. A079000.
Sequence in context: A043050 A159843 A243652 * A138168 A047279 A162917
Adjacent sequences: A080777 A080778 A080779 * A080781 A080782 A080783


KEYWORD

nonn


AUTHOR

Benoit Cloitre, Feb 23 2003


STATUS

approved



