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.

A229710 Least m of maximal order mod n such that m is a sum of two squares.

Table of values

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

List of values

[2, 5, 5, 5, 2, 13, 2, 5, 2, 5, 2, 5, 5, 5, 2, 13, 2, 13, 5, 5, 2, 37, 2, 5, 2, 13, 13, 5, 2, 5, 2, 5, 2, 13, 2, 13, 13, 5, 5, 13, 2, 5, 5, 5, 5, 13, 5, 37, 2, 5, 2, 5, 2, 37, 2, 13, 2, 13, 2, 5, 2, 5, 2, 5, 2, 17, 13, 5, 5, 5, 2, 13, 2, 37, 29, 13, 2, 13, 2, 5]

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

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