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.

A284890 a(1)=2, and then a(n+1) = a(n) + k where prime(k) is the least prime dividing a(n).

Table of values

n a(n)
1 2
2 3
3 5
4 8
5 9
6 11
7 16
8 17
9 24
10 25
11 28
12 29
13 39
14 41
15 54
16 55
17 58
18 59
19 76
20 77
21 81
22 83
23 106
24 107
25 135
26 137
27 170
28 171
29 173
30 213
31 215
32 218
33 219
34 221
35 227
36 276
37 277
38 336
39 337
40 405
41 407
42 412
43 413
44 417
45 419
46 500
47 501
48 503
49 599
50 708
51 709
52 836
53 837
54 839
55 985
56 988
57 989

List of values

[2, 3, 5, 8, 9, 11, 16, 17, 24, 25, 28, 29, 39, 41, 54, 55, 58, 59, 76, 77, 81, 83, 106, 107, 135, 137, 170, 171, 173, 213, 215, 218, 219, 221, 227, 276, 277, 336, 337, 405, 407, 412, 413, 417, 419, 500, 501, 503, 599, 708, 709, 836, 837, 839, 985, 988, 989]