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.

A373461 a(n) = s - t where s = ceiling(sqrt(n*i)), t = sqrt(m), and m = s^2 mod n, for the smallest positive integer i for which m is square.

Table of values

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

List of values

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