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.

A000790 Primary pretenders: least composite c such that n^c == n (mod c).

Table of values

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

List of values

[4, 4, 341, 6, 4, 4, 6, 6, 4, 4, 6, 10, 4, 4, 14, 6, 4, 4, 6, 6, 4, 4, 6, 22, 4, 4, 9, 6, 4, 4, 6, 6, 4, 4, 6, 9, 4, 4, 38, 6, 4, 4, 6, 6, 4, 4, 6, 46, 4, 4, 10, 6, 4, 4, 6, 6, 4, 4, 6, 15, 4, 4, 9, 6, 4, 4, 6, 6, 4, 4, 6, 9, 4, 4, 15, 6, 4, 4, 6, 6, 4, 4, 6, 21, 4, 4, 10, 6, 4]