A064771 - cp's OEIS frontend

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

n	a(n)
1	6
2	20
3	28
4	78
5	88
6	102
7	104
8	114
9	138
10	174
11	186
12	222
13	246
14	258
15	272
16	282
17	304
18	318
19	354
20	366
21	368
22	402
23	426
24	438
25	464
26	474
27	490
28	496
29	498
30	534
31	572
32	582
33	606
34	618
35	642
36	650
37	654
38	678
39	748
40	762
41	786
42	822
43	834
44	860
45	894
46	906
47	940
48	942
49	978
50	1002
51	1014
52	1038

[6, 20, 28, 78, 88, 102, 104, 114, 138, 174, 186, 222, 246, 258, 272, 282, 304, 318, 354, 366, 368, 402, 426, 438, 464, 474, 490, 496, 498, 534, 572, 582, 606, 618, 642, 650, 654, 678, 748, 762, 786, 822, 834, 860, 894, 906, 940, 942, 978, 1002, 1014, 1038]

cp's OEIS Frontend

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

Table of values

List of values