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.

A065521 a(n) = floor(prime(n) / n) * n - prime(n) mod n.

Table of values

n a(n)
1 2
2 1
3 1
4 1
5 9
6 11
7 11
8 13
9 13
10 11
11 13
12 35
13 37
14 41
15 43
16 43
17 43
18 47
19 47
20 49
21 53
22 53
23 55
24 55
25 53
26 55
27 59
28 61
29 65
30 67
31 121
32 125
33 127
34 133
35 131
36 137
37 139
38 141
39 145
40 147
41 149
42 155
43 153
44 159
45 163
46 169
47 165
48 161
49 165
50 171
51 175
52 177
53 183
54 181
55 183
56 185
57 187
58 193
59 195
60 199

List of values

[2, 1, 1, 1, 9, 11, 11, 13, 13, 11, 13, 35, 37, 41, 43, 43, 43, 47, 47, 49, 53, 53, 55, 55, 53, 55, 59, 61, 65, 67, 121, 125, 127, 133, 131, 137, 139, 141, 145, 147, 149, 155, 153, 159, 163, 169, 165, 161, 165, 171, 175, 177, 183, 181, 183, 185, 187, 193, 195, 199]