|
| |
|
|
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; internal format)
|
|
|
|
OFFSET
| 1,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)
|
|
|
EXAMPLE
| a(1) cannot be 1 because 1 is not composite; it can be 2.
|
|
|
CROSSREFS
| Cf. A079000, A079254, A085925, A099798.
Sequence in context: A039032 A000062 A047317 * A004059 A189404 A161793
Adjacent sequences: A099794 A099795 A099796 * A099798 A099799 A099800
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 02 2004
|
| |
|
|
