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.

A065505 Let p(k) denote k-th prime; consider solutions (p(n),p(m)) of Diophantine equation p(p(n)+1)-6.p(p(m))=1 (*), where p(p(n)) belongs to A060213 and p(p(m))=(p(p(n))+1)/6; sequence gives values of p(n).

Table of values

n a(n)
0 7
1 2309
2 2753
3 2789
4 26183
5 46933
6 53597
7 58411
8 61357
9 69481
10 87691
11 111487
12 124991
13 134327
14 140659
15 144651
16 147551
17 236519
18 247711
19 164643
20 270223
21 291359

List of values

[7, 2309, 2753, 2789, 26183, 46933, 53597, 58411, 61357, 69481, 87691, 111487, 124991, 134327, 140659, 144651, 147551, 236519, 247711, 164643, 270223, 291359]