|
Search: id:A080780
|
|
|
| A080780 |
|
a(1)=2; 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 6)". |
|
+0
1
|
|
| 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; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
J.-P. Allouche, N. Rampersad and J. Shallit, On integer sequences whose first iterates are linear, Aequationes Math. 69 (2005), 114-127
|
|
LINKS
|
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: A091942 A047555 A043050 this_sequence A138168 A047279 A118471
Adjacent sequences: A080777 A080778 A080779 this_sequence A080781 A080782 A080783
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre, Feb 23 2003
|
|
|
Search completed in 0.002 seconds
|
