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.

A107741 Smallest number m such that prime(n) = m + (digit sum of m), a(n)=0 if no such m exists.

Table of values

n a(n)
1 1
2 0
3 0
4 0
5 10
6 11
7 13
8 14
9 16
10 19
11 0
12 32
13 34
14 35
15 37
16 0
17 52
18 53
19 56
20 58
21 59
22 71
23 73
24 76
25 0
26 91
27 92
28 94
29 95
30 97
31 122
32 124
33 127
34 128
35 142
36 143
37 146
38 149
39 160
40 163
41 166
42 167
43 181
44 182
45 184
46 185
47 0
48 215
49 217
50 218
51 0
52 232
53 233
54 238
55 250
56 253
57 256
58 257
59 0
60 271

List of values

[1, 0, 0, 0, 10, 11, 13, 14, 16, 19, 0, 32, 34, 35, 37, 0, 52, 53, 56, 58, 59, 71, 73, 76, 0, 91, 92, 94, 95, 97, 122, 124, 127, 128, 142, 143, 146, 149, 160, 163, 166, 167, 181, 182, 184, 185, 0, 215, 217, 218, 0, 232, 233, 238, 250, 253, 256, 257, 0, 271]