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.

A182011 a(n) is the smallest number k such that the difference between the greatest prime divisor of k and the sum of the other distinct prime divisors equals n.

Table of values

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

List of values

[6, 2, 3, 21, 5, 55, 7, 33, 22, 39, 11, 85, 13, 51, 34, 57, 17, 115, 19, 69, 46, 203, 23, 145, 1295, 87, 58, 93, 29, 259, 31, 185, 615, 111, 74, 205, 37, 123, 82, 129, 41, 235, 43, 141, 94, 371, 47, 265, 1239, 159, 106, 413, 53, 295, 2345, 177, 118, 183, 59, 469]