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.

A224221 a(0)=3; for n>0, a(n) is the smallest odd 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 41
7 61
8 53
9 131
10 43
11 19
12 277
13 379
14 137
15 239
16 79
17 157
18 331
19 71

List of values

[3, 5, 7, 13, 29, 37, 41, 61, 53, 131, 43, 19, 277, 379, 137, 239, 79, 157, 331, 71]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.