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.

A217857 w(n) = w(pqr) = Gpf(p + q)*Gpf(p + r)*Gpf(q + r), defined when n belongs to A217856, with Gpf(m): greatest prime dividing m.

Table of values

n a(n)
1 50
2 75
3 98
4 18
5 70
6 75
7 338
8 12
9 245
10 50
11 75
12 455
13 722
14 63
15 20
16 98
17 50
18 50
19 63
20 147
21 475
22 30
23 182
24 385
25 1922
26 12
27 242
28 105
29 325
30 175
31 338
32 75
33 117
34 3698
35 28
36 1463
37 363
38 50
39 310
40 45
41 75
42 935
43 98
44 147
45 12
46 507
47 242
48 325
49 245
50 105
51 7442
52 171
53 1859
54 98
55 63
56 2365

List of values

[50, 75, 98, 18, 70, 75, 338, 12, 245, 50, 75, 455, 722, 63, 20, 98, 50, 50, 63, 147, 475, 30, 182, 385, 1922, 12, 242, 105, 325, 175, 338, 75, 117, 3698, 28, 1463, 363, 50, 310, 45, 75, 935, 98, 147, 12, 507, 242, 325, 245, 105, 7442, 171, 1859, 98, 63, 2365]