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.

A178201 Smallest k such that 40^k mod k = n.

Table of values

n a(n)
0 1
1 3
2 19
3 37
4 6
5 7
6 17
7 11
8 92
9 31
10 15
11 29
12 794
13 21
14 26
15 215
16 22
17 23
18 98
19 49
20 124
21 19849
22 42
23 12405874306277
24 284
25 75
26 1574
27 221
28 36
29 323
30 70
31 119
32 56
33 133
34 58
35 685
36 44
37 69
38 142
39 187
40 41
41 31561
42 82
43 3197
44 148
45 10073
46 51
47 511
48 176
49 37603
50 62
51 437
52 86
53 1339
54 1546
55 63
56 386
57 12599
58 138
59 3017
60 140
61 493
62 1538
63 529
64 72
65 935
66 118
67 303
68 253
69 277061
70 95

List of values

[1, 3, 19, 37, 6, 7, 17, 11, 92, 31, 15, 29, 794, 21, 26, 215, 22, 23, 98, 49, 124, 19849, 42, 12405874306277, 284, 75, 1574, 221, 36, 323, 70, 119, 56, 133, 58, 685, 44, 69, 142, 187, 41, 31561, 82, 3197, 148, 10073, 51, 511, 176, 37603, 62, 437, 86, 1339, 1546, 63, 386, 12599, 138, 3017, 140, 493, 1538, 529, 72, 935, 118, 303, 253, 277061, 95]