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.

A191833 Least number k such that k^k == k+1 (mod m), or 0 if no such k exists, where m = A007310(n).

Table of values

n a(n)
1 1
2 7
3 10
4 14
5 19
6 11
7 16
8 3
9 27
10 43
11 46
12 178
13 55
14 36
15 100
16 64
17 33
18 79
19 147
20 43
21 56
22 258
23 16
24 86
25 135
26 52
27 31
28 27
29 398
30 335
31 33
32 187
33 213
34 151
35 43
36 680
37 163
38 61
39 38
40 243
41 29
42 327
43 39
44 213
45 2068
46 72
47 37
48 799
49 198
50 223
51 141
52 887
53 92
54 304
55 132
56 250
57 808
58 217
59 327
60 192
61 271
62 538
63 398
64 187
65 79
66 38
67 31
68 1713
69 0
70 413
71 24
72 1287
73 976
74 501
75 48

List of values

[1, 7, 10, 14, 19, 11, 16, 3, 27, 43, 46, 178, 55, 36, 100, 64, 33, 79, 147, 43, 56, 258, 16, 86, 135, 52, 31, 27, 398, 335, 33, 187, 213, 151, 43, 680, 163, 61, 38, 243, 29, 327, 39, 213, 2068, 72, 37, 799, 198, 223, 141, 887, 92, 304, 132, 250, 808, 217, 327, 192, 271, 538, 398, 187, 79, 38, 31, 1713, 0, 413, 24, 1287, 976, 501, 48]