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.

A225318 Numbers n such that either prime(n-1) == -1 (mod n) or prime(n+1) == -1 (mod n) but not both.

Table of values

n a(n)
1 2
2 4
3 7
4 8
5 14
6 16
7 26
8 27
9 32
10 33
11 35
12 76
13 78
14 169
15 170
16 172
17 175
18 177
19 183
20 184
21 185
22 434
23 446
24 1054
25 1056
26 2638
27 2702
28 6468
29 15930
30 40069
31 40070
32 40080
33 40112
34 40115
35 40157
36 251721
37 251758
38 251767
39 251770
40 251788
41 637286
42 4124464
43 4124704

List of values

[2, 4, 7, 8, 14, 16, 26, 27, 32, 33, 35, 76, 78, 169, 170, 172, 175, 177, 183, 184, 185, 434, 446, 1054, 1056, 2638, 2702, 6468, 15930, 40069, 40070, 40080, 40112, 40115, 40157, 251721, 251758, 251767, 251770, 251788, 637286, 4124464, 4124704]