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.

A261198 Start with n and repeat the map x -> x+sumdigits(x) until reaching a prime, which is a(n), or 0 if no prime is reached.

Table of values

n a(n)
1 2
2 23
3 0
4 23
5 11
6 0
7 19
8 23
9 0
10 11
11 13
12 0
13 17
14 19
15 0
16 23
17 37
18 0
19 29
20 41
21 0
22 41
23 101
24 0
25 37
26 41
27 0
28 101
29 59
30 0
31 43
32 37
33 0
34 41
35 43
36 0
37 47
38 101
39 0
40 59
41 67
42 0
43 89
44 59
45 0
46 67
47 71
48 0
49 101
50 89
51 0
52 59
53 61
54 0
55 89
56 67
57 0
58 71
59 73
60 0
61 103
62 101
63 0
64 127
65 89
66 0
67 109
68 103
69 0
70 101
71 79
72 0
73 83
74 127
75 0
76 89
77 101
78 0
79 109
80 109
81 0
82 103
83 107
84 0
85 127
86 101
87 0
88 109
89 113
90 0
91 101
92 103
93 0
94 107
95 109
96 0
97 113
98 127
99 0
100 101

List of values

[2, 23, 0, 23, 11, 0, 19, 23, 0, 11, 13, 0, 17, 19, 0, 23, 37, 0, 29, 41, 0, 41, 101, 0, 37, 41, 0, 101, 59, 0, 43, 37, 0, 41, 43, 0, 47, 101, 0, 59, 67, 0, 89, 59, 0, 67, 71, 0, 101, 89, 0, 59, 61, 0, 89, 67, 0, 71, 73, 0, 103, 101, 0, 127, 89, 0, 109, 103, 0, 101, 79, 0, 83, 127, 0, 89, 101, 0, 109, 109, 0, 103, 107, 0, 127, 101, 0, 109, 113, 0, 101, 103, 0, 107, 109, 0, 113, 127, 0, 101]