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.

A125601 a(n) is the smallest k > 0 such that there are exactly n numbers whose sum of proper divisors is k.

Table of values

n a(n)
0 2
1 3
2 6
3 21
4 37
5 31
6 49
7 79
8 73
9 91
10 115
11 127
12 151
13 121
14 181
15 169
16 217
17 265
18 253
19 271
20 211
21 301
22 433
23 379
24 331
25 361
26 457
27 391
28 451
29 655
30 463
31 541
32 421
33 775
34 511
35 769
36 673
37 715
38 865
39 691
40 1015
41 631
42 1069
43 1075
44 721
45 931
46 781
47 1123
48 871
49 925
50 901
51 1177
52 991
53 1297

List of values

[2, 3, 6, 21, 37, 31, 49, 79, 73, 91, 115, 127, 151, 121, 181, 169, 217, 265, 253, 271, 211, 301, 433, 379, 331, 361, 457, 391, 451, 655, 463, 541, 421, 775, 511, 769, 673, 715, 865, 691, 1015, 631, 1069, 1075, 721, 931, 781, 1123, 871, 925, 901, 1177, 991, 1297]