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.

A073316 a(n) = Max d(j), j=1..n-1, where d(j) is the smallest positive number such that 2j+d(j) and 2n+d(j) are both prime. A generalization of A073310.

Table of values

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

List of values

[1, 1, 5, 3, 5, 5, 3, 5, 11, 9, 17, 15, 13, 17, 15, 13, 11, 23, 21, 19, 23, 21, 23, 21, 19, 17, 15, 13, 23, 21, 19, 17, 15, 13, 29, 29, 27, 25, 23, 21, 19, 17, 15, 23, 21, 19, 17, 15, 13, 29, 35, 33, 31, 41, 39, 53, 51, 49, 47, 45, 43, 41, 39, 37, 35, 33, 31, 35, 33, 31, 29, 27]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.