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.

A203612 For any number n take the polynomial formed by the product of the terms (x-pi), where pi’s are the prime factors of n. Then calculate the area between the minimum and the maximum value of the prime factors. This sequence lists the numbers for which the area is a positive integer.

Table of values

n a(n)
1 429
2 605
3 663
4 969
5 1001
6 1105
7 1183
8 1311
9 1445
10 1653
11 1955
12 2139
13 2185
14 2261
15 2527
16 2553
17 2645
18 2697
19 2755
20 3179
21 3219
22 3335
23 3741
24 3813
25 4199
26 4205
27 4371
28 4551
29 4693
30 4807
31 4929
32 4991
33 5217
34 5289
35 5819
36 5865
37 5883
38 5945
39 5957
40 6063
41 6293
42 6355
43 6549
44 6630

List of values

[429, 605, 663, 969, 1001, 1105, 1183, 1311, 1445, 1653, 1955, 2139, 2185, 2261, 2527, 2553, 2645, 2697, 2755, 3179, 3219, 3335, 3741, 3813, 4199, 4205, 4371, 4551, 4693, 4807, 4929, 4991, 5217, 5289, 5819, 5865, 5883, 5945, 5957, 6063, 6293, 6355, 6549, 6630]