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.

A226746 Numbers n such that x^2 = 1 has more than two solutions in the Gaussian integers modulo n.

Table of values

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

List of values

[4, 5, 6, 8, 10, 12, 13, 14, 15, 16, 17, 18, 20, 21, 22, 24, 25, 26, 28, 29, 30, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 44, 45, 46, 48, 50, 51, 52, 53, 54, 55, 56, 57, 58, 60, 61, 62, 63, 64, 65, 66, 68, 69, 70, 72, 73, 74, 75, 76, 77, 78, 80, 82, 84, 85]

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

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