A260947 - cp's OEIS frontend

A260947 Least positive integer k < prime(n) such that k = i + j for some 0 < i < j for which i,j,k and ijk are all primitive roots modulo prime(n), or 0 if no such k exists.

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

[0, 0, 0, 0, 8, 0, 10, 13, 15, 10, 24, 15, 13, 29, 15, 8, 8, 17, 13, 28, 20, 35, 8, 19, 15, 15, 11, 7, 24, 17, 29, 8, 24, 15, 10, 13, 20, 18, 15, 5, 8, 28, 47, 15, 5, 41, 29, 11, 8, 31, 17, 21, 51, 24, 10, 15, 10, 21, 11, 15]

cp's OEIS Frontend

A260947 Least positive integer k < prime(n) such that k = i + j for some 0 < i < j for which i,j,k and ijk are all primitive roots modulo prime(n), or 0 if no such k exists.

Table of values

List of values

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

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

cp's OEIS Frontend

A260947 Least positive integer k < prime(n) such that k = i + j for some 0 < i < j for which i,j,k and i*j*k are all primitive roots modulo prime(n), or 0 if no such k exists.

Table of values

List of values

A260947 Least positive integer k < prime(n) such that k = i + j for some 0 < i < j for which i,j,k and ijk are all primitive roots modulo prime(n), or 0 if no such k exists.

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