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.

A118336 a(n) = greatest multiple of (p(n+1) - p(n)) which is < p(n), where p(m) is the m-th prime.

Table of values

n a(n)
1 1
2 2
3 4
4 4
5 10
6 12
7 16
8 16
9 18
10 28
11 30
12 36
13 40
14 40
15 42
16 48
17 58
18 60
19 64
20 70
21 72
22 76
23 78
24 88
25 96
26 100
27 100
28 106
29 108
30 112
31 124
32 126
33 136
34 130
35 148
36 150
37 156
38 160
39 162
40 168
41 178
42 180
43 190
44 192
45 196
46 192
47 204
48 220
49 226
50 228
51 228
52 238
53 240
54 246
55 252
56 258
57 268
58 270
59 276

List of values

[1, 2, 4, 4, 10, 12, 16, 16, 18, 28, 30, 36, 40, 40, 42, 48, 58, 60, 64, 70, 72, 76, 78, 88, 96, 100, 100, 106, 108, 112, 124, 126, 136, 130, 148, 150, 156, 160, 162, 168, 178, 180, 190, 192, 196, 192, 204, 220, 226, 228, 228, 238, 240, 246, 252, 258, 268, 270, 276]