cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A059496 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. Take the lexicographically earliest sequence. Digits may be replaced by any nonzero digit.

Table of values

n a(n)
1 2
2 3
3 5
4 7
5 17
6 11
7 13
8 19
9 29
10 23
11 43
12 41
13 47
14 37
15 31
16 61
17 67
18 97
19 197
20 191
21 193
22 199
23 139
24 131
25 137
26 127
27 157
28 151
29 181
30 281
31 283
32 223
33 227
34 229
35 239
36 233
37 263
38 269
39 569
40 563
41 523
42 521
43 541
44 547
45 557
46 577
47 571
48 271
49 277
50 257
51 251
52 211
53 241
54 641
55 643
56 647
57 617
58 613
59 619

List of values

[2, 3, 5, 7, 17, 11, 13, 19, 29, 23, 43, 41, 47, 37, 31, 61, 67, 97, 197, 191, 193, 199, 139, 131, 137, 127, 157, 151, 181, 281, 283, 223, 227, 229, 239, 233, 263, 269, 569, 563, 523, 521, 541, 547, 557, 577, 571, 271, 277, 257, 251, 211, 241, 641, 643, 647, 617, 613, 619]