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.

A113604 Define f(k) = k + sum of digits of n. a(n) is the first prime that results by applying f zero or more times to n, or 0 if no such prime exists.

Table of values

n a(n)
1 2
2 2
3 3
4 23
5 5
6 0
7 7
8 23
9 0
10 11
11 11
12 0
13 13
14 19
15 0
16 23
17 17
18 0
19 19
20 41
21 0
22 41
23 23
24 0
25 37
26 41
27 0
28 101
29 29
30 0
31 31
32 37
33 0
34 41
35 43
36 0
37 37
38 101
39 0
40 59
41 41
42 0
43 43
44 59
45 0
46 67
47 47
48 0
49 101
50 89
51 0
52 59
53 53
54 0
55 89
56 67
57 0
58 71
59 59
60 0
61 61
62 101
63 0
64 127
65 89
66 0
67 67
68 103
69 0
70 101
71 71
72 0
73 73
74 127
75 0
76 89

List of values

[2, 2, 3, 23, 5, 0, 7, 23, 0, 11, 11, 0, 13, 19, 0, 23, 17, 0, 19, 41, 0, 41, 23, 0, 37, 41, 0, 101, 29, 0, 31, 37, 0, 41, 43, 0, 37, 101, 0, 59, 41, 0, 43, 59, 0, 67, 47, 0, 101, 89, 0, 59, 53, 0, 89, 67, 0, 71, 59, 0, 61, 101, 0, 127, 89, 0, 67, 103, 0, 101, 71, 0, 73, 127, 0, 89]