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.

A093701 a(n) = smallest m>a(n-1) such that 1+m*n is prime, a(1) = 1.

Table of values

n a(n)
1 1
2 2
3 4
4 7
5 8
6 10
7 16
8 17
9 18
10 19
11 30
12 31
13 34
14 35
15 36
16 37
17 38
18 41
19 58
20 59
21 62
22 64
23 72
24 73
25 76
26 77
27 80
28 81
29 84
30 85
31 88
32 95
33 96
34 97
35 102
36 103
37 106
38 111
39 114
40 118
41 122
42 123
43 124
44 125
45 130
46 132
47 134
48 135
49 138
50 140
51 142
52 144
53 150
54 152
55 156
56 158
57 164
58 166
59 174
60 175

List of values

[1, 2, 4, 7, 8, 10, 16, 17, 18, 19, 30, 31, 34, 35, 36, 37, 38, 41, 58, 59, 62, 64, 72, 73, 76, 77, 80, 81, 84, 85, 88, 95, 96, 97, 102, 103, 106, 111, 114, 118, 122, 123, 124, 125, 130, 132, 134, 135, 138, 140, 142, 144, 150, 152, 156, 158, 164, 166, 174, 175]