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.

A306257 a(n) = t for the minimal integer k > t such that k^2 mod n = t^2 is a perfect square.

Table of values

n a(n)
1 0
2 0
3 1
4 0
5 2
6 2
7 2
8 1
9 0
10 3
11 3
12 2
13 3
14 3
15 1
16 0
17 4
18 0
19 4
20 4
21 2
22 4
23 4
24 1
25 0
26 5
27 3
28 5
29 5
30 2
31 5
32 2
33 4
34 5
35 1
36 0
37 6
38 6
39 5
40 3
41 6
42 4
43 6
44 6
45 2
46 6
47 6
48 1
49 0
50 0
51 7
52 7
53 7
54 6
55 3
56 5
57 5
58 7
59 7
60 2
61 7
62 7
63 1
64 0
65 4
66 8
67 8
68 8
69 7
70 2
71 8
72 3
73 8
74 8
75 5
76 8
77 2
78 7
79 8
80 1
81 0
82 9
83 9
84 4
85 6
86 9
87 7
88 9
89 9
90 4
91 3
92 9
93 8
94 9
95 7
96 2
97 9
98 0
99 1
100 0
101 10
102 8
103 10
104 9
105 4

List of values

[0, 0, 1, 0, 2, 2, 2, 1, 0, 3, 3, 2, 3, 3, 1, 0, 4, 0, 4, 4, 2, 4, 4, 1, 0, 5, 3, 5, 5, 2, 5, 2, 4, 5, 1, 0, 6, 6, 5, 3, 6, 4, 6, 6, 2, 6, 6, 1, 0, 0, 7, 7, 7, 6, 3, 5, 5, 7, 7, 2, 7, 7, 1, 0, 4, 8, 8, 8, 7, 2, 8, 3, 8, 8, 5, 8, 2, 7, 8, 1, 0, 9, 9, 4, 6, 9, 7, 9, 9, 4, 3, 9, 8, 9, 7, 2, 9, 0, 1, 0, 10, 8, 10, 9, 4]