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.

A260960 Least positive integer k < prime(n) such that there are 0 < i < j with i^2 + j^2 = k^2 for which (i*j)/2 is a primitive root modulo prime(n), or 0 if no such k exists.

Table of values

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

List of values

[0, 0, 0, 0, 5, 5, 5, 17, 13, 17, 10, 10, 5, 13, 13, 25, 5, 5, 39, 25, 17, 5, 5, 5, 17, 29, 5, 5, 5, 5, 5, 5, 5, 34, 17, 5, 5, 26, 13, 13, 5, 10, 29, 13, 13, 5, 34, 5, 5, 5, 5, 25, 25, 5, 5, 13, 17, 5, 5, 10, 29, 13, 13, 61, 17, 13, 17, 17, 5, 13]