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.

A248004 Least positive integer m with prime(m*n) == 1 (mod m+n).

Table of values

n a(n)
1 3
2 4
3 1
4 2
5 2
6 15
7 1
8 1
9 5
10 10
11 2
12 3
13 4
14 18
15 6
16 27
17 4
18 7
19 35
20 4
21 45
22 2
23 47
24 9
25 5
26 10
27 16
28 11
29 3
30 3
31 9
32 61
33 1
34 52
35 3
36 60
37 53
38 74
39 8
40 47
41 7
42 60
43 128
44 5
45 21
46 12
47 2
48 29
49 15
50 127
51 53
52 28
53 17
54 21
55 303
56 80
57 72
58 8
59 61
60 36

List of values

[3, 4, 1, 2, 2, 15, 1, 1, 5, 10, 2, 3, 4, 18, 6, 27, 4, 7, 35, 4, 45, 2, 47, 9, 5, 10, 16, 11, 3, 3, 9, 61, 1, 52, 3, 60, 53, 74, 8, 47, 7, 60, 128, 5, 21, 12, 2, 29, 15, 127, 53, 28, 17, 21, 303, 80, 72, 8, 61, 36]