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.

A295997 Least composite k such that d^k == d (mod k) for every divisor d of n.

Table of values

n a(n)
1 4
2 341
3 6
4 341
5 4
6 561
7 6
8 341
9 6
10 561
11 10
12 561
13 4
14 561
15 561
16 341
17 4
18 561
19 6
20 561
21 6
22 561
23 22
24 561
25 4
26 561
27 6
28 561
29 4
30 561
31 6
32 341
33 561
34 561
35 561
36 561
37 4
38 561
39 6
40 561
41 4
42 561
43 6
44 561
45 561
46 341
47 46
48 561
49 6
50 561
51 91
52 561
53 4
54 561
55 10
56 561
57 6
58 341
59 15
60 561
61 4
62 341

List of values

[4, 341, 6, 341, 4, 561, 6, 341, 6, 561, 10, 561, 4, 561, 561, 341, 4, 561, 6, 561, 6, 561, 22, 561, 4, 561, 6, 561, 4, 561, 6, 341, 561, 561, 561, 561, 4, 561, 6, 561, 4, 561, 6, 561, 561, 341, 46, 561, 6, 561, 91, 561, 4, 561, 10, 561, 6, 341, 15, 561, 4, 341]

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

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