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.

A067603 Least k such that gcd(prime(k)+1, prime(k+1)+1) = 2n.

Table of values

n a(n)
1 2
2 4
3 9
4 72
5 34
6 91
7 62
8 478
9 205
10 2016
11 522
12 909
13 1440
14 5375
15 2149
16 6610
17 7604
18 2976
19 5229
20 7488
21 11251
22 7499
23 8805
24 20179
25 18526
26 70885
27 28193
28 40985
29 33847
30 17625
31 27069
32 77199
33 66156
34 90764
35 26186
36 141235
37 70317
38 856719
39 110769
40 50523
41 217229

List of values

[2, 4, 9, 72, 34, 91, 62, 478, 205, 2016, 522, 909, 1440, 5375, 2149, 6610, 7604, 2976, 5229, 7488, 11251, 7499, 8805, 20179, 18526, 70885, 28193, 40985, 33847, 17625, 27069, 77199, 66156, 90764, 26186, 141235, 70317, 856719, 110769, 50523, 217229]