A253303 - cp's OEIS frontend

A253303 Smallest integer m such that gcd{x | sum of proper divisors of x is m} is equal to 2*n, when there are at least two such x's.

n	a(n)
1	16
2	136
3	186
4	1352
5	1340
6	1356
7	1414
8	1276
9	1026
10	15640
11	6742
12	1968
13	35786
14	924
15	11076
16	11812
17	61714
18	14556
19	76862
20	6440
21	12774
22	70444
23	62446
24	16080
25	24904
26	16152
27	27900
28	65464
29	36026
30	41100
31	85810
32	56008
33	50142
34	23152

[16, 136, 186, 1352, 1340, 1356, 1414, 1276, 1026, 15640, 6742, 1968, 35786, 924, 11076, 11812, 61714, 14556, 76862, 6440, 12774, 70444, 62446, 16080, 24904, 16152, 27900, 65464, 36026, 41100, 85810, 56008, 50142, 23152]

cp's OEIS Frontend

A253303 Smallest integer m such that gcd{x | sum of proper divisors of x is m} is equal to 2*n, when there are at least two such x's.

Table of values

List of values