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.

A135093 Least composite number k for each possible difference gpf(k)-lpf(k).

Table of values

n a(n)
0 4
1 6
2 15
3 10
4 21
5 14
6 55
7 33
8 22
9 39
10 26
11 85
12 51
13 34
14 57
15 38
16 115
17 69
18 46
19 203
20 145
21 87
22 58
23 93
24 62
25 259
26 185
27 111
28 74
29 205
30 123
31 82
32 129
33 86
34 235
35 141
36 94
37 371
38 265
39 159
40 106
41 413
42 295
43 177
44 118
45 183
46 122
47 469
48 335
49 201
50 134
51 355
52 213
53 142
54 219
55 146
56 553
57 395
58 237

List of values

[4, 6, 15, 10, 21, 14, 55, 33, 22, 39, 26, 85, 51, 34, 57, 38, 115, 69, 46, 203, 145, 87, 58, 93, 62, 259, 185, 111, 74, 205, 123, 82, 129, 86, 235, 141, 94, 371, 265, 159, 106, 413, 295, 177, 118, 183, 122, 469, 335, 201, 134, 355, 213, 142, 219, 146, 553, 395, 237]