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.

A248590 Least positive integer m such that prime(m) == 1 (mod m + n).

Table of values

n a(n)
1 3
2 4
3 19
4 10
5 5
6 6
7 13
8 15
9 7
10 8
11 31
12 17
13 9
14 19
15 20
16 38
17 22
18 10
19 11
20 24
21 78
22 80
23 25
24 12
25 28
26 30
27 13
28 14
29 599
30 97
31 15
32 31
33 32
34 178
35 33
36 16
37 102
38 104
39 35
40 108
41 17
42 18
43 38
44 39
45 361
46 40
47 19
48 41
49 73
50 20
51 21
52 43
53 45
54 78
55 134
56 22
57 391
58 47
59 23
60 84

List of values

[3, 4, 19, 10, 5, 6, 13, 15, 7, 8, 31, 17, 9, 19, 20, 38, 22, 10, 11, 24, 78, 80, 25, 12, 28, 30, 13, 14, 599, 97, 15, 31, 32, 178, 33, 16, 102, 104, 35, 108, 17, 18, 38, 39, 361, 40, 19, 41, 73, 20, 21, 43, 45, 78, 134, 22, 391, 47, 23, 84]