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.

A065511 Let p(k) denote k-th prime; consider solutions (n,m) of the Diophantine system {p(p(n)+1)-p(p(n))=2, p(p(n))-6.p(p(m))=-1} (*); sequence gives values of m.

Table of values

n a(n)
0 1
1 92
2 105
3 106
4 689
5 1138
6 1280
7 1373
8 1432
9 1600
10 1960
11 2416
12 2683
13 2846
14 2968
15 3042
16 3091
17 4694
18 4884
19 5191
20 5284
21 5642
22 6905
23 6949
24 7074
25 7095
26 7213
27 7274
28 7418

List of values

[1, 92, 105, 106, 689, 1138, 1280, 1373, 1432, 1600, 1960, 2416, 2683, 2846, 2968, 3042, 3091, 4694, 4884, 5191, 5284, 5642, 6905, 6949, 7074, 7095, 7213, 7274, 7418]