[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A059498
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. Take the lexicographically earliest sequence. Digits may be replaced by any larger digit.
3
2, 3, 5, 7, 17, 19, 29, 59, 79, 89, 389, 2389, 2399, 2699, 2999, 4999, 8999, 98999, 298999, 598999, 599999, 799999, 1799999, 4799999, 4999999, 904999999, 974999999, 60974999999, 68974999999, 68975999999, 3000068975999999, 3000568975999999
(list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
It is not known if the sequence is infinite.
LINKS
Sean A. Irvine, Table of n, a(n) for n = 1..500
CROSSREFS
Another decimal analog of A059458. Cf. A059471, A059497.
Sequence in context: A069802 A067954 A061248 * A247147 A158085 A119833
Adjacent sequences: A059495 A059496 A059497 * A059499 A059500 A059501
KEYWORD
nonn,base,nice
AUTHOR
David W. Wilson, Feb 05 2001
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified November 16 00:14 EST 2024. Contains 377778 sequences.
License Agreements, Terms of Use, Privacy Policy