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.

A239293 Smallest composite c > n such that n^c == n (mod c).

Table of values

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

List of values

[4, 341, 6, 6, 10, 10, 14, 9, 12, 15, 15, 22, 21, 15, 21, 20, 34, 25, 38, 21, 28, 33, 33, 25, 28, 27, 39, 36, 35, 49, 49, 33, 44, 35, 45, 42, 45, 39, 57, 52, 82, 66, 77, 45, 55, 69, 65, 49, 56, 51, 65, 65, 65, 55, 63, 57, 65, 66, 87, 65, 91, 63, 93, 65, 70, 78, 85]

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

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