|
Search: id:A059471
|
|
|
| A059471 |
|
a(1) = 2; a(n+1) is obtained by and trying to change just one digit of a(n), starting with the least significant digit, until a new prime is reached. |
|
+0
6
|
|
| 2, 3, 5, 7, 17, 11, 13, 19, 29, 23, 43, 41, 47, 37, 31, 61, 67, 97, 197, 191, 193, 199, 109, 101, 103, 107, 127, 137, 131, 139, 149, 179, 173, 113, 163, 167, 157, 151, 181, 281, 283, 223, 227, 229, 239, 233, 263, 269, 569, 563, 503, 509, 599, 593, 523, 521, 541, 547, 557
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Take the lexicographically earliest sequence, subject to the rules that the left-most digit must be replaced by a nonzero digit, the other digits by any digit.
It is not known if the sequence is infinite.
|
|
CROSSREFS
|
Decimal analogue of A059458. See also A059472 for primes that are missed. Cf. A059496, A059497.
Sequence in context: A024377 A025069 A094575 this_sequence A059496 A066814 A072885
Adjacent sequences: A059468 A059469 A059470 this_sequence A059472 A059473 A059474
|
|
KEYWORD
|
nonn,base,nice
|
|
AUTHOR
|
njas, Feb 03 2001
|
|
EXTENSIONS
|
More terms from David W. Wilson (davidwwilson(AT)comcast.net), Feb 05 2001.
|
|
|
Search completed in 0.002 seconds
|
