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.

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.

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 109
24 101
25 103
26 107
27 127
28 137
29 131
30 139
31 149
32 179
33 173
34 113
35 163
36 167
37 157
38 151
39 181
40 281
41 283
42 223
43 227
44 229
45 239
46 233
47 263
48 269
49 569
50 563
51 503
52 509
53 599
54 593
55 523
56 521
57 541
58 547
59 557

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