A260946 - cp's OEIS frontend

A260946 Least positive integer k < prime(n) such that i^2 + j^2 = k^2 for some 0 < i < j with ijk a primitive root modulo prime(n), or 0 if no such k exists.

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

[0, 0, 0, 0, 10, 0, 15, 5, 5, 5, 0, 17, 5, 15, 5, 10, 10, 26, 10, 17, 5, 5, 5, 5, 5, 13, 15, 5, 10, 15, 15, 10, 13, 13, 5, 17, 5, 10, 5, 10, 10, 10, 25, 61, 10, 13, 17, 25, 5, 50, 15, 13, 17, 10, 15, 5, 5, 10, 17, 10, 26, 10, 10, 17, 5, 10, 5, 5, 5, 13]

cp's OEIS Frontend

A260946 Least positive integer k < prime(n) such that i^2 + j^2 = k^2 for some 0 < i < j with ijk a primitive root 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	10
6	0
7	15
8	5
9	5
10	5
11	0
12	17
13	5
14	15
15	5
16	10
17	10
18	26
19	10
20	17
21	5
22	5
23	5
24	5
25	5
26	13
27	15
28	5
29	10
30	15
31	15
32	10
33	13
34	13
35	5
36	17
37	5
38	10
39	5
40	10
41	10
42	10
43	25
44	61
45	10
46	13
47	17
48	25
49	5
50	50
51	15
52	13
53	17
54	10
55	15
56	5
57	5
58	10
59	17
60	10
61	26
62	10
63	10
64	17
65	5
66	10
67	5
68	5
69	5
70	13

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

cp's OEIS Frontend

A260946 Least positive integer k < prime(n) such that i^2 + j^2 = k^2 for some 0 < i < j with i*j*k a primitive root modulo prime(n), or 0 if no such k exists.

Table of values

List of values

A260946 Least positive integer k < prime(n) such that i^2 + j^2 = k^2 for some 0 < i < j with ijk a primitive root modulo prime(n), or 0 if no such k exists.

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