A080710 -id:A080710 - cp's OEIS frontend

A080720 a(0) = 5; 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".

5, 7, 8, 10, 11, 12, 13, 15, 18, 19, 21, 24, 27, 30, 31, 33, 34, 35, 36, 39, 40, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 54, 55, 57, 60, 63, 66, 67, 68, 69, 72, 73, 75, 78, 81, 84, 87, 90, 93, 96, 99, 102, 103, 104, 105, 108, 109, 111, 112, 113, 114, 115, 116, 117, 118, 119

Offset: 0

N. J. A. Sloane, Mar 05 2003

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

Cf. A079000, A003605, A079253, A080711, A080710.

{a=5; m=[5]; for(n=1,66,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))}

a(a(n)) = 3*(n+4).

More terms and PARI code from Klaus Brockhaus, Mar 07 2003

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

Original entry on oeis.org

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

Offset: 0

N. J. A. Sloane, Mar 05 2003

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

Cf. A079000, A003605, A079253, A080710, A080712.

{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))}

a(a(n)) = 3*(n+2).

More terms and PARI code from Klaus Brockhaus, Mar 06 2003

A080712 a(0) = 4; 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".

Original entry on oeis.org

4, 5, 7, 8, 9, 12, 13, 15, 18, 21, 22, 23, 24, 27, 28, 30, 31, 32, 33, 34, 35, 36, 39, 42, 45, 46, 47, 48, 51, 52, 54, 57, 60, 63, 66, 69, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 84, 87, 90, 91, 92, 93, 96, 97, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111

Offset: 0

N. J. A. Sloane, Mar 05 2003

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

Cf. A079000, A003605, A079253, A080711, A080710.

{a=4; m=[4]; for(n=1,67,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))}

a(a(n)) = 3*(n+3).

More terms and PARI code from Klaus Brockhaus, Mar 06 2003

A115837 Self-describing sequence. The n-th integer of the sequence indicates how many integers of the sequence are strictly < 3n.

Original entry on oeis.org

1, 3, 4, 6, 9, 10, 12, 13, 14, 15, 18, 19, 21, 24, 27, 30, 31, 32, 33, 36, 37, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 51, 54, 57, 58, 59, 60, 63, 64, 66, 69, 72, 75, 78, 81, 84, 87, 90, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 105, 108, 111, 112, 113, 114, 117, 118, 120

Offset: 1

Eric Angelini, Feb 01 2006

Terms computed by Gilles Sadowski. In building step by step the sequence one has sometimes the choice for an integer. If so take the smallest available one.

Is this the same sequence as A080710? - Andrew S. Plewe, May 08 2007

			a(7)=12 because there are 12 integers in the sequence which are strictly < 21 (they are 1,3,4,6,9,10,12,13,14,15,18,19).

cp's OEIS Frontend

A080720 a(0) = 5; 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".

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

Extensions

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

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

Extensions

A080712 a(0) = 4; 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".

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

Extensions

A115837 Self-describing sequence. The n-th integer of the sequence indicates how many integers of the sequence are strictly < 3n.

Views

Author

Keywords

Comments

Examples