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.

A381122 Numbers k such that k^(k+1) == k (mod k+2).

Table of values

n a(n)
1 0
2 1
3 4
4 8
5 12
6 20
7 24
8 28
9 32
10 36
11 44
12 56
13 60
14 72
15 80
16 84
17 92
18 104
19 116
20 120
21 132
22 140
23 144
24 156
25 164
26 168
27 176
28 180
29 192
30 200
31 204
32 212
33 216
34 224
35 252
36 260
37 272
38 276
39 296
40 300
41 312
42 324
43 332
44 344
45 356
46 360
47 380
48 384
49 392
50 396
51 420
52 444
53 452
54 456
55 464
56 476
57 480
58 500
59 512
60 524
61 536
62 540
63 552
64 560

List of values

[0, 1, 4, 8, 12, 20, 24, 28, 32, 36, 44, 56, 60, 72, 80, 84, 92, 104, 116, 120, 132, 140, 144, 156, 164, 168, 176, 180, 192, 200, 204, 212, 216, 224, 252, 260, 272, 276, 296, 300, 312, 324, 332, 344, 356, 360, 380, 384, 392, 396, 420, 444, 452, 456, 464, 476, 480, 500, 512, 524, 536, 540, 552, 560]