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.

A140604 Least nontrivial number k such that the sum of the digits of k^k (mod k) == n.

Table of values

n a(n)
0 1
1 4
2 55
3 6
4 7
5 8
6 12
7 2236
8 11
9 15
10 14
11 20
12 21
13 17
14 274
15 35
16 22
17 44
18 36
19 82
20 73
21 41
22 29
23 28
24 26
25 115
26 85
27 98
28 2054
29 31
30 46
31 502
32 40
33 39
34 79
35 3248
36 45
37 38
38 128
39 64
40 511
41 80
42 183
43 83
44 76
45 47
46 127
47 176
48 52
49 70
50 190
51 57
52 65
53 425
54 63
55 56
56 95
57 59
58 10327
59 794
60 1248
61 89
62 410
63 69

List of values

[1, 4, 55, 6, 7, 8, 12, 2236, 11, 15, 14, 20, 21, 17, 274, 35, 22, 44, 36, 82, 73, 41, 29, 28, 26, 115, 85, 98, 2054, 31, 46, 502, 40, 39, 79, 3248, 45, 38, 128, 64, 511, 80, 183, 83, 76, 47, 127, 176, 52, 70, 190, 57, 65, 425, 63, 56, 95, 59, 10327, 794, 1248, 89, 410, 69]