A059498 - cp's OEIS frontend

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.

n	a(n)
1	2
2	3
3	5
4	7
5	17
6	19
7	29
8	59
9	79
10	89
11	389
12	2389
13	2399
14	2699
15	2999
16	4999
17	8999
18	98999
19	298999
20	598999
21	599999
22	799999
23	1799999
24	4799999
25	4999999
26	904999999
27	974999999
28	60974999999
29	68974999999
30	68975999999
31	3000068975999999
32	3000568975999999

[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]

cp's OEIS Frontend

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.

Table of values

List of values