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.

A016837 Primes reached after k iterations of sum of n and its prime divisors = t (where t replaces n in each iteration).

Table of values

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

List of values

[23, 11, 23, 17, 11, 23, 23, 23, 17, 47, 19, 41, 23, 23, 47, 53, 41, 59, 29, 31, 47, 71, 47, 47, 41, 71, 71, 89, 71, 167, 83, 47, 53, 47, 71, 113, 59, 71, 71, 269, 83, 131, 59, 167, 71, 167, 59, 149, 167, 71, 167, 191, 83, 71, 167, 79, 89, 179, 251, 227, 167, 149, 149, 83, 269, 239, 89, 167, 251, 263, 251, 251, 113, 239, 149, 167]