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.

A196330 Smallest number k such that the number of distinct residues of x^k (mod k) equals n.

Table of values

n a(n)
1 1
2 2
3 3
4 6
5 5
6 10
7 7
8 14
9 21
10 68
11 11
12 22
13 13
14 26
15 15
16 114
17 17
18 34
19 19
20 38
21 57
22 164
23 23
24 46
25 2525
26 776
27 657
28 212
29 29
30 58
31 31
32 62
33 33
34 4112
35 35
36 102
37 37
38 74
39 111
40 380
41 41
42 82
43 43
44 86
45 105
46 356
47 47
48 94
49 301
50 388
51 51
52 404
53 53
54 106
55 6275
56 182
57 1467
58 452
59 59
60 118

List of values

[1, 2, 3, 6, 5, 10, 7, 14, 21, 68, 11, 22, 13, 26, 15, 114, 17, 34, 19, 38, 57, 164, 23, 46, 2525, 776, 657, 212, 29, 58, 31, 62, 33, 4112, 35, 102, 37, 74, 111, 380, 41, 82, 43, 86, 105, 356, 47, 94, 301, 388, 51, 404, 53, 106, 6275, 182, 1467, 452, 59, 118]