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.

A227180 Composite numbers n such that b^(n-1) == 1 (mod n) implies b == -1 or +1 (mod n).

Table of values

n a(n)
1 4
2 6
3 8
4 9
5 10
6 12
7 14
8 16
9 18
10 20
11 22
12 24
13 26
14 27
15 30
16 32
17 34
18 36
19 38
20 40
21 42
22 44
23 46
24 48
25 50
26 54
27 56
28 58
29 60
30 62
31 64
32 68
33 72
34 74
35 78
36 80
37 81
38 82
39 84
40 86
41 88
42 90
43 92
44 94
45 96
46 98
47 100
48 102
49 104
50 106
51 108
52 110
53 114
54 116
55 118
56 120
57 122
58 126
59 128
60 132
61 134
62 136
63 138
64 140
65 142
66 144
67 146
68 150
69 152
70 156
71 158
72 160
73 162
74 164
75 166
76 168
77 170

List of values

[4, 6, 8, 9, 10, 12, 14, 16, 18, 20, 22, 24, 26, 27, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 54, 56, 58, 60, 62, 64, 68, 72, 74, 78, 80, 81, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108, 110, 114, 116, 118, 120, 122, 126, 128, 132, 134, 136, 138, 140, 142, 144, 146, 150, 152, 156, 158, 160, 162, 164, 166, 168, 170]