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.

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

Table of values

n a(n)
2 4
3 6
4 9
5 12
6 14
7 18
8 21
9 25
10 30
11 33
12 38
13 42
14 46
15 49
16 55
17 60
18 62
19 69
20 72
21 74
22 82
23 85
24 91
25 98
26 102
27 106
28 108
29 111
30 121
31 129
32 133
33 138
34 141
35 150
36 155
37 158
38 166
39 169
40 177
41 180
42 183
43 192
44 194
45 198
46 201
47 213
48 226
49 228
50 230
51 235
52 240
53 247
54 253
55 259
56 265
57 270
58 274
59 278

List of values

[4, 6, 9, 12, 14, 18, 21, 25, 30, 33, 38, 42, 46, 49, 55, 60, 62, 69, 72, 74, 82, 85, 91, 98, 102, 106, 108, 111, 121, 129, 133, 138, 141, 150, 155, 158, 166, 169, 177, 180, 183, 192, 194, 198, 201, 213, 226, 228, 230, 235, 240, 247, 253, 259, 265, 270, 274, 278]