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.

A242277 Least positive primitive root g < prime(n) mod prime(n) such that g is the sum of the first k primes for some k > 0, or 0 if such a number g does not exist.

Table of values

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

List of values

[0, 2, 2, 5, 2, 2, 5, 2, 5, 2, 17, 2, 17, 5, 5, 2, 2, 2, 2, 28, 5, 28, 2, 28, 5, 2, 5, 2, 10, 5, 58, 2, 5, 2, 2, 77, 5, 2, 5, 2, 2, 2, 28, 5, 2, 41, 2, 5, 2, 10, 5, 41, 129, 77, 5, 5, 2, 58, 5, 41, 5, 2, 5, 17, 10, 2, 28, 10, 2, 2, 5, 28, 10, 2, 2, 5, 2, 5, 17, 28]

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

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