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.

A363786 a(0) = 2. For n >= 1, a(n) is the least prime p such that a(n-1) + p has n prime factors counted with multiplicity.

Table of values

n a(n)
0 2
1 3
2 3
3 5
4 11
5 37
6 59
7 229
8 347
9 421
10 3163
11 4517
12 1627
13 26021
14 14939
15 34213
16 64091
17 378277
18 14939
19 3392933
20 146011
21 6931877
22 8796763
23 37340581
24 25573979
25 238667173
26 113654363
27 1018807717
28 491141723
29 4743349669
30 8544205403
31 10246276517
32 491141723

List of values

[2, 3, 3, 5, 11, 37, 59, 229, 347, 421, 3163, 4517, 1627, 26021, 14939, 34213, 64091, 378277, 14939, 3392933, 146011, 6931877, 8796763, 37340581, 25573979, 238667173, 113654363, 1018807717, 491141723, 4743349669, 8544205403, 10246276517, 491141723]