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.

A076618 Least x>1 such that x^d == 1 (mod d) for each divisor d of n.

Table of values

n a(n)
1 2
2 3
3 4
4 3
5 6
6 7
7 8
8 3
9 4
10 11
11 12
12 7
13 14
14 15
15 16
16 3
17 18
18 7
19 20
20 11
21 22
22 23
23 24
24 7
25 6
26 27
27 4
28 15
29 30
30 31
31 32
32 3
33 34
34 35
35 36
36 7
37 38
38 39
39 40
40 11
41 42
42 43
43 44
44 23
45 16
46 47
47 48
48 7
49 8
50 11
51 52
52 27
53 54
54 7
55 56
56 15
57 58
58 59
59 60
60 31
61 62
62 63
63 22
64 3
65 66
66 67
67 68
68 35
69 70
70 71
71 72
72 7
73 74
74 75
75 16
76 39

List of values

[2, 3, 4, 3, 6, 7, 8, 3, 4, 11, 12, 7, 14, 15, 16, 3, 18, 7, 20, 11, 22, 23, 24, 7, 6, 27, 4, 15, 30, 31, 32, 3, 34, 35, 36, 7, 38, 39, 40, 11, 42, 43, 44, 23, 16, 47, 48, 7, 8, 11, 52, 27, 54, 7, 56, 15, 58, 59, 60, 31, 62, 63, 22, 3, 66, 67, 68, 35, 70, 71, 72, 7, 74, 75, 16, 39]