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.

A076619 Least x>1 such that x^d == 1 (mod d) for each divisor d of n, for all nonsquarefree numbers n (cf. A013929).

Table of values

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

List of values

[3, 3, 4, 7, 3, 7, 11, 7, 6, 4, 15, 3, 7, 11, 23, 16, 7, 8, 11, 27, 7, 15, 31, 22, 3, 35, 7, 16, 39, 11, 4, 43, 23, 31, 47, 7, 15, 34, 11, 27, 7, 15, 59, 40, 31, 12, 63, 6, 43, 3, 67, 16, 35, 71, 7, 22, 75, 31, 39, 52, 79, 11, 7, 83, 43, 14, 58, 87, 36, 23, 31, 47, 95, 22, 7, 15, 67]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.