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.

A318411 Least k (>1) such that m^k == m mod A005117(n) for 0 <= m <= A005117(n) - 1.

Table of values

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

List of values

[2, 3, 5, 3, 7, 5, 11, 13, 7, 5, 17, 19, 7, 11, 23, 13, 29, 5, 31, 11, 17, 13, 37, 19, 13, 41, 7, 43, 23, 47, 17, 53, 21, 19, 29, 59, 61, 31, 13, 11, 67, 23, 13, 71, 73, 37, 31, 13, 79, 41, 83, 17, 43, 29, 89, 13, 31, 47, 37, 97, 101, 17, 103, 13, 53, 107, 109, 21, 37, 113, 19]

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

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