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.

A039739 a(n)=2*q-prime(n), where q is the prime < p(n) for which (prime(n) mod q) is maximal.

Table of values

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

List of values

[1, 1, 3, 3, 1, 5, 3, 3, 5, 3, 1, 5, 3, 11, 5, 3, 1, 7, 3, 1, 3, 3, 5, 9, 5, 3, 11, 9, 5, 7, 3, 5, 3, 9, 7, 1, 3, 11, 5, 15, 13, 3, 1, 5, 3, 3, 3, 27, 25, 21, 15, 13, 3, 5, 11, 5, 3, 1, 17, 15, 5, 7, 3, 1, 9, 3, 9, 11, 9, 5, 3, 15, 9, 3, 3, 5, 1, 21, 13, 3, 1]