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.

A362502 Least k > 0 such that (floor(sqrt(n*k)) + 1)^2 mod n is a square.

Table of values

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

List of values

[1, 1, 1, 1, 1, 2, 3, 1, 3, 4, 5, 1, 7, 8, 1, 1, 9, 4, 11, 2, 1, 14, 15, 1, 8, 16, 1, 3, 19, 2, 21, 1, 3, 24, 1, 2, 25, 26, 3, 1, 29, 2, 31, 6, 1, 34, 35, 1, 15, 4, 3, 7, 39, 4, 1, 2, 3, 44, 45, 1, 47, 48, 1, 2, 1, 4, 51, 10, 5, 2, 55, 1, 57, 58, 5, 12, 1, 6, 63, 1, 5, 64, 65, 1, 3, 68]