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.

A096385 a(n) = smallest prime p with p^n mod n = 1.

Table of values

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

List of values

[3, 7, 3, 11, 5, 29, 3, 7, 11, 23, 5, 53, 13, 31, 3, 103, 5, 191, 3, 37, 23, 47, 5, 11, 53, 7, 13, 59, 11, 311, 3, 67, 67, 71, 5, 149, 37, 61, 3, 83, 5, 173, 23, 31, 47, 283, 5, 29, 11, 103, 5, 107, 5, 31, 13, 7, 59, 709, 7, 367, 61, 37, 3, 131, 23, 269, 13, 139, 29, 569]

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

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