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.

A178196 Smallest k such that 35^k mod k = n.

Table of values

n a(n)
0 1
1 2
2 3
3 26
4 31
5 10
6 29
7 14
8 9
9 13
10 55
11 57
12 23
13 92
14 21
15 22
16 19
17 99
18 187
19 134
20 2105
21 28
22 169
23 1202
24 593791
25 30
26 27
27 1198
28 203
29 46
30 695
31 66
32 42843
33 248
34 4023706859
35 37
36 449467
37 132
38 327
39 1186
40 565
41 74
42 581
43 394
44 14277
45 110
46 59867
47 62
48 1311139
49 56
50 75

List of values

[1, 2, 3, 26, 31, 10, 29, 14, 9, 13, 55, 57, 23, 92, 21, 22, 19, 99, 187, 134, 2105, 28, 169, 1202, 593791, 30, 27, 1198, 203, 46, 695, 66, 42843, 248, 4023706859, 37, 449467, 132, 327, 1186, 565, 74, 581, 394, 14277, 110, 59867, 62, 1311139, 56, 75]