|
| |
|
|
A079254
|
|
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 prime".
|
|
7
| |
|
|
4, 6, 8, 11, 12, 13, 14, 17, 18, 20, 23, 29, 31, 37, 38, 39, 41, 43, 44, 47, 48, 49, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 71, 73, 74, 79, 80, 83, 89, 90, 91, 97, 101, 103, 104, 105, 106, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 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 prime; it cannot be 2, for then 1 is not in the sequence while a(1) is prime; nor can it be 3; but 4 is possible.
|
|
|
CROSSREFS
| Cf. A079000.
Sequence in context: A088011 A050835 A054284 * A091178 A152019 A091181
Adjacent sequences: A079251 A079252 A079253 * A079255 A079256 A079257
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Matthew Vandermast (ghodges14(AT)comcast.net) and N. J. A. Sloane (njas(AT)research.att.com), Feb 01 2003
|
| |
|
|
