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.

A362138 a(n) = gpf(a(n-1) + prime(n)) where gpf is the greatest prime factor and a(1)=2.

Table of values

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

List of values

[2, 5, 5, 3, 7, 5, 11, 5, 7, 3, 17, 3, 11, 3, 5, 29, 11, 3, 7, 13, 43, 61, 3, 23, 5, 53, 13, 5, 19, 11, 23, 11, 37, 11, 5, 13, 17, 5, 43, 3, 13, 97, 3, 7, 17, 3, 107, 11, 17, 41, 137, 47, 3, 127, 3, 19, 3, 137, 23, 19, 151, 37, 43, 59, 31, 29, 5, 19, 61, 41, 197]