|
Search: id:A080723
|
|
|
| A080723 |
|
a(0) = 1; 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) == 1 mod 3". |
|
+0
1
|
|
| 1, 4, 5, 6, 7, 10, 13, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 28, 31, 34, 37, 40, 43, 46, 49, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 82, 85, 88, 91, 94, 97, 100, 103, 106, 109, 112, 115, 118, 121, 124
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
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+4, n >= 0.
|
|
PROGRAM
|
(PARI) {print1(1, ", "); a=4; m=[4]; for(n=2, 68, print1(a, ", "); a=a+1; if(m[1]==n, while(a%3!=1, a++); m=if(length(m)==1, [], vecextract(m, "2..")), if(a%3==1, a++)); m=concat(m, a))}
|
|
CROSSREFS
|
Cf. A079000, A080720, ...
Sequence in context: A039024 A065028 A107756 this_sequence A022561 A047312 A004714
Adjacent sequences: A080720 A080721 A080722 this_sequence A080724 A080725 A080726
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Mar 08 2003
|
|
EXTENSIONS
|
More terms and PARI code from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Mar 08 2003
|
|
|
Search completed in 0.002 seconds
|
