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.

A224222 a(0)=3; for n>0, a(n) is the smallest prime q not already in the sequence such that the n-th prime p(n) divides a(n-1)+q. If no such prime q exists, the sequence terminates.

Table of values

n a(n)
0 3
1 5
2 7
3 13
4 29
5 37
6 2
7 83
8 31
9 61
10 113
11 11
12 137
13 109
14 149
15 227
16 197
17 157
18 331
19 71

List of values

[3, 5, 7, 13, 29, 37, 2, 83, 31, 61, 113, 11, 137, 109, 149, 227, 197, 157, 331, 71]