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.

A271669 Smallest k > n such that n divides k and n^k == n (mod k).

Table of values

n a(n)
1 2
2 161038
3 6
4 12
5 10
6 30
7 14
8 56
9 18
10 30
11 22
12 132
13 26
14 182
15 30
16 48
17 34
18 306
19 38
20 380
21 42
22 66
23 46
24 552
25 50
26 130
27 54
28 84
29 58
30 870
31 62
32 992
33 66
34 102
35 70
36 180
37 74
38 1406
39 78
40 120
41 82
42 1722
43 86
44 1892
45 90
46 138
47 94
48 2256
49 98
50 350
51 102
52 156
53 106
54 2862
55 110
56 280
57 114
58 174
59 118
60 3540

List of values

[2, 161038, 6, 12, 10, 30, 14, 56, 18, 30, 22, 132, 26, 182, 30, 48, 34, 306, 38, 380, 42, 66, 46, 552, 50, 130, 54, 84, 58, 870, 62, 992, 66, 102, 70, 180, 74, 1406, 78, 120, 82, 1722, 86, 1892, 90, 138, 94, 2256, 98, 350, 102, 156, 106, 2862, 110, 280, 114, 174, 118, 3540]