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.

A092067 a(n) is the smallest number m such that m > 1 and m divides n^m + 1.

Table of values

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

List of values

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