login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A099797 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 composite". 1
2, 4, 5, 6, 8, 9, 11, 12, 14, 17, 18, 20, 23, 24, 29, 31, 32, 33, 37, 38, 41, 43, 44, 45, 47, 53, 59, 61, 62, 67, 68, 69, 70, 71, 73, 79, 80, 81, 83, 89, 90, 97, 98, 99, 100, 101, 102, 103, 107, 109, 113, 127, 128, 131, 137, 139, 149, 151, 152, 157, 158, 159, 163, 167 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

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)

EXAMPLE

a(1) cannot be 1 because 1 is not composite; it can be 2.

CROSSREFS

Cf. A079000, A079254, A085925, A099798.

Sequence in context: A289166 A247161 A285360 * A004059 A189404 A316681

Adjacent sequences:  A099794 A099795 A099796 * A099798 A099799 A099800

KEYWORD

nonn

AUTHOR

Ray Chandler, Nov 02 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 22 13:41 EST 2020. Contains 331149 sequences. (Running on oeis4.)