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.

A069817 Smallest remainder of p+q modulo n, where p*q = n^2 - 1, 1 < p < n-1, or n if no such factorization exists.

Table of values

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

List of values

[1, 2, 3, 4, 1, 6, 2, 0, 3, 6, 1, 12, 3, 2, 0, 8, 2, 18, 1, 4, 0, 10, 2, 0, 5, 6, 3, 12, 1, 30, 2, 8, 12, 2, 0, 12, 7, 10, 3, 16, 1, 42, 3, 4, 15, 14, 2, 0, 2, 14, 3, 20, 3, 6, 0, 0, 15, 22, 4, 60, 11, 2, 0, 8, 5, 18, 5, 20, 3, 26, 1, 72, 13, 10, 15]