login
A059471
a(1) = 2; a(n+1) is obtained by trying to change just one digit of a(n), starting with the least significant digit, until a new prime is reached.
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
OFFSET
1,1
COMMENTS
Take the lexicographically earliest sequence, subject to the rules that the leftmost digit must be replaced by a nonzero digit, the other digits by any digit.
It is not known if the sequence is infinite.
The sequence is finite with last term a(17115) = 3377464733, see links for illustration. - Reinhard Zumkeller, Apr 20 2011
Zumkeller's demonstration of finiteness is false if some other leading 0 rather than the immediate leading 0 can be replaced, otherwise a(17116) = 203377464733 (cf. also A059498). - Sean A. Irvine, Sep 25 2022
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..17115 (full sequence)
Reinhard Zumkeller, A Haskell program for A059471
CROSSREFS
Decimal analog of A059458. See also A059472 for primes that are missed.
Sequence in context: A215658 A295266 A372407 * A059496 A066814 A358047
KEYWORD
nonn,base,nice,fini,full
AUTHOR
N. J. A. Sloane, Feb 03 2001
EXTENSIONS
More terms from David W. Wilson, Feb 05 2001
Keyword fini added by Reinhard Zumkeller, Apr 20 2011
STATUS
approved