|
Search: id:A080711
|
|
|
| A080711 |
|
a(0) = 2; for n>0, a(n) is taken to be the smallest positive 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 a multiple of 3". |
|
+0
4
|
|
| 2, 4, 6, 7, 9, 10, 12, 15, 16, 18, 21, 22, 24, 25, 26, 27, 30, 31, 33, 34, 35, 36, 39, 40, 42, 45, 48, 51, 52, 53, 54, 57, 58, 60, 63, 66, 69, 70, 71, 72, 75, 76, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 90, 93, 96, 97, 98, 99, 102, 103, 105, 106, 107, 108, 109, 110, 111, 112
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
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
|
|
FORMULA
|
a(a(n)) = 3*(n+2).
|
|
PROGRAM
|
(PARI) {a=2; m=[2]; for(n=1, 68, print1(a, ", "); a=a+1; if(m[1]==n, while(a%3>0, a++); m=if(length(m)==1, [], vecextract(m, "2..")), if(a%3==0, a++)); m=concat(m, a))}
|
|
CROSSREFS
|
Cf. A079000, A003605, A079253, A080710, A080712.
Sequence in context: A079393 A047512 A026273 this_sequence A022301 A050099 A052056
Adjacent sequences: A080708 A080709 A080710 this_sequence A080712 A080713 A080714
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Mar 05 2003
|
|
EXTENSIONS
|
More terms and PARI code from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Mar 06 2003
|
|
|
Search completed in 0.002 seconds
|
