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.

A316221 Let S(n) = set of divisors of n, excluding n; sequence gives n such that there is a unique relatively prime subset of S(n) that sums to n.

Table of values

n a(n)
1 6
2 12
3 18
4 20
5 28
6 42
7 54
8 56
9 66
10 88
11 100
12 104
13 162
14 176
15 196
16 208
17 272
18 304
19 368
20 414
21 460
22 464
23 486
24 490
25 496
26 500
27 558
28 572
29 580
30 650
31 666
32 726
33 736
34 748
35 812
36 820
37 868
38 928
39 968
40 992
41 1036
42 1148
43 1184
44 1204
45 1312
46 1316
47 1352
48 1372
49 1376
50 1458
51 1484
52 1504

List of values

[6, 12, 18, 20, 28, 42, 54, 56, 66, 88, 100, 104, 162, 176, 196, 208, 272, 304, 368, 414, 460, 464, 486, 490, 496, 500, 558, 572, 580, 650, 666, 726, 736, 748, 812, 820, 868, 928, 968, 992, 1036, 1148, 1184, 1204, 1312, 1316, 1352, 1372, 1376, 1458, 1484, 1504]