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.

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

Table of values

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

List of values

[0, 0, 2, 0, 3, 0, 5, 5, 0, 7, 0, 7, 11, 0, 13, 0, 11, 11, 11, 13, 19, 17, 17, 13, 0, 0, 17, 17, 17, 23, 17, 19, 19, 19, 0, 0, 23, 23, 29, 23, 0, 23, 23, 23, 0, 43, 29, 29, 0, 29, 0, 31, 31, 37, 29, 29, 37, 41, 37, 41, 37, 43, 41, 0, 41, 47, 41, 61, 37, 41, 41, 37, 43, 53, 41, 41, 43, 47]

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

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