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.

A076082 Consider all composite numbers between prime(n) and prime(n+1); take those with greatest number of divisors; a(n) is the smallest of them.

Table of values

n a(n)
2 4
3 6
4 8
5 12
6 16
7 18
8 20
9 24
10 30
11 36
12 40
13 42
14 44
15 48
16 54
17 60
18 66
19 70
20 72
21 78
22 80
23 84
24 90
25 100
26 102
27 104
28 108
29 112
30 120
31 128
32 132
33 138
34 144
35 150
36 156
37 160
38 165
39 168
40 176
41 180
42 182
43 192
44 196
45 198
46 210
47 216
48 224
49 228
50 230
51 234
52 240
53 246
54 252
55 260
56 264
57 270
58 276
59 280

List of values

[4, 6, 8, 12, 16, 18, 20, 24, 30, 36, 40, 42, 44, 48, 54, 60, 66, 70, 72, 78, 80, 84, 90, 100, 102, 104, 108, 112, 120, 128, 132, 138, 144, 150, 156, 160, 165, 168, 176, 180, 182, 192, 196, 198, 210, 216, 224, 228, 230, 234, 240, 246, 252, 260, 264, 270, 276, 280]