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.

A138306 Least prime p such that 2n = p + g, where g is a prime primitive root of p, or 0 if there is no such prime p.

Table of values

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

List of values

[0, 0, 0, 5, 7, 7, 0, 0, 11, 13, 17, 13, 0, 17, 23, 19, 23, 0, 0, 23, 23, 31, 43, 29, 37, 41, 37, 37, 41, 41, 43, 0, 47, 61, 41, 43, 67, 47, 47, 67, 59, 53, 73, 47, 47, 61, 53, 59, 67, 0, 59, 61, 59, 67, 97, 89, 97, 79, 71, 61, 79, 71, 73, 67, 71, 71, 97, 83, 71, 137, 113, 0, 103, 89]

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

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