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.

A213382 Numbers n such that n^n mod (n + 2) = n.

Table of values

n a(n)
1 1
2 4
3 7
4 13
5 16
6 19
7 31
8 37
9 49
10 55
11 61
12 67
13 85
14 91
15 109
16 121
17 127
18 139
19 157
20 175
21 181
22 193
23 196
24 199
25 211
26 217
27 235
28 247
29 265
30 289
31 301
32 307
33 313
34 319
35 325
36 337
37 379
38 391
39 397
40 409
41 415
42 445
43 451
44 469
45 487
46 499
47 517
48 535
49 541
50 571
51 577
52 589
53 595
54 631
55 667
56 679

List of values

[1, 4, 7, 13, 16, 19, 31, 37, 49, 55, 61, 67, 85, 91, 109, 121, 127, 139, 157, 175, 181, 193, 196, 199, 211, 217, 235, 247, 265, 289, 301, 307, 313, 319, 325, 337, 379, 391, 397, 409, 415, 445, 451, 469, 487, 499, 517, 535, 541, 571, 577, 589, 595, 631, 667, 679]