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.

A200996 Least upper limit for numbers u and v such that u*n-1 and v*n+1 are both prime, u and v not necessarily distinct.

Table of values

n a(n)
1 3
2 2
3 2
4 1
5 4
6 1
7 4
8 2
9 2
10 2
11 4
12 1
13 8
14 2
15 2
16 2
17 6
18 1
19 10
20 2
21 2
22 2
23 6
24 3
25 6
26 4
27 4
28 3
29 6
30 1
31 10
32 3
33 4
34 3
35 4
36 2
37 4
38 5
39 6
40 2
41 4
42 1
43 6
44 2
45 4
46 3
47 6
48 2
49 4
50 3
51 2
52 2
53 4
54 2
55 6
56 3
57 4
58 3
59 12
60 1
61 8
62 5
63 4
64 3
65 6
66 2
67 6
68 2
69 2
70 2
71 8
72 1
73 14
74 2
75 2
76 3
77 6
78 3
79 4
80 3
81 8
82 2
83 4
84 4
85 12

List of values

[3, 2, 2, 1, 4, 1, 4, 2, 2, 2, 4, 1, 8, 2, 2, 2, 6, 1, 10, 2, 2, 2, 6, 3, 6, 4, 4, 3, 6, 1, 10, 3, 4, 3, 4, 2, 4, 5, 6, 2, 4, 1, 6, 2, 4, 3, 6, 2, 4, 3, 2, 2, 4, 2, 6, 3, 4, 3, 12, 1, 8, 5, 4, 3, 6, 2, 6, 2, 2, 2, 8, 1, 14, 2, 2, 3, 6, 3, 4, 3, 8, 2, 4, 4, 12]