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.

A073943 a(n) = smallest m such that n-th prime divides m^m + 1.

Table of values

n a(n)
1 1
2 5
3 2
4 3
5 21
6 6
7 24
8 27
9 11
10 14
11 15
12 6
13 25
14 63
15 23
16 26
17 117
18 30
19 99
20 35
21 9
22 39
23 165
24 11
25 6
26 10
27 51
28 213
29 54
30 7
31 63
32 261
33 174
34 23
35 74
36 33
37 78
38 27
39 83
40 86
41 357
42 30
43 95
44 12
45 14
46 11
47 15
48 111
49 453
50 18
51 12
52 119
53 90
54 501
55 4
56 131
57 82
58 135
59 117
60 60
61 45
62 138
63 51
64 95
65 54
66 114
67 75

List of values

[1, 5, 2, 3, 21, 6, 24, 27, 11, 14, 15, 6, 25, 63, 23, 26, 117, 30, 99, 35, 9, 39, 165, 11, 6, 10, 51, 213, 54, 7, 63, 261, 174, 23, 74, 33, 78, 27, 83, 86, 357, 30, 95, 12, 14, 11, 15, 111, 453, 18, 12, 119, 90, 501, 4, 131, 82, 135, 117, 60, 45, 138, 51, 95, 54, 114, 75]

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

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