|
Search: id:A059498
|
|
|
| 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. |
|
+0
2
|
|
| 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; listen)
|
|
|
|
|
Search completed in 0.002 seconds
|
