A099798 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 not composite".

1, 2, 3, 6, 8, 11, 12, 13, 14, 15, 17, 19, 23, 29, 31, 32, 37, 38, 41, 42, 44, 45, 47, 48, 49, 50, 51, 52, 53, 54, 59, 61, 62, 63, 64, 65, 67, 71, 72, 74, 79, 83, 84, 89, 97, 98, 101, 103, 107, 109, 113, 127, 131, 137, 138, 140, 141, 142, 149, 150, 151, 157, 163, 167

Offset

1,2

Links

Table of n, a(n) for n=1..64.

Benoit Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, J. Integer Seqs., Vol. 6 (2003), #03.2.2.

Benoit Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, arXiv:math/0305308 [math.NT], 2003.

Example

a(4) cannot be 4 because 4 is composite; it cannot be 5, for then 4 is not in the sequence while a(4) is not composite; but 6 is possible.

Crossrefs

Cf. A079000, A079254, A085925, A099797.

Sequence in context: A076627 A020489 A002240 * A230108 A097383 A072893

Adjacent sequences: A099795 A099796 A099797 * A099799 A099800 A099801

Keyword

nonn

Author

Ray Chandler, Nov 02 2004

Status

approved