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.

A268174 Integers m such that m^(m+1) == 1 (modulo (m+2)).

Table of values

n a(n)
1 1
2 3
3 5
4 9
5 11
6 15
7 17
8 21
9 27
10 29
11 35
12 39
13 41
14 45
15 51
16 57
17 59
18 65
19 69
20 71
21 77
22 81
23 87
24 95
25 99
26 101
27 105
28 107
29 111
30 125
31 129
32 135
33 137
34 147
35 149
36 155
37 161
38 165
39 171
40 177
41 179
42 189
43 191
44 195
45 197
46 209
47 221
48 225
49 227
50 231
51 237
52 239
53 249
54 255
55 261
56 267
57 269
58 275
59 279
60 281
61 291
62 305
63 309
64 311
65 315
66 329
67 335
68 339
69 345

List of values

[1, 3, 5, 9, 11, 15, 17, 21, 27, 29, 35, 39, 41, 45, 51, 57, 59, 65, 69, 71, 77, 81, 87, 95, 99, 101, 105, 107, 111, 125, 129, 135, 137, 147, 149, 155, 161, 165, 171, 177, 179, 189, 191, 195, 197, 209, 221, 225, 227, 231, 237, 239, 249, 255, 261, 267, 269, 275, 279, 281, 291, 305, 309, 311, 315, 329, 335, 339, 345]