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.

A178202 Smallest k such that 41^k mod k = n.

Table of values

n a(n)
0 1
1 2
2 3
3 19
4 37
5 76
6 7
7 17
8 9
9 22
10 31
11 15
12 29
13 77
14 309
15 34
16 7194589
17 26
18 23
19 341
20 21
21 55
22 799
23 1658
24 476983
25 46
26 27
27 427
28 629
29 52
30 142241
31 138
32 68889
33 136
34 1897
35 129
36 30935
37 44
38 19303
39 1642
40 34943
41 43
42 8858994648397
43 102
44 117
45 436
46 7715
47 86
48 49

List of values

[1, 2, 3, 19, 37, 76, 7, 17, 9, 22, 31, 15, 29, 77, 309, 34, 7194589, 26, 23, 341, 21, 55, 799, 1658, 476983, 46, 27, 427, 629, 52, 142241, 138, 68889, 136, 1897, 129, 30935, 44, 19303, 1642, 34943, 43, 8858994648397, 102, 117, 436, 7715, 86, 49]