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.

A123930 a(n) = smallest k > 1 that is the sum of the proper divisors (cf. A001065) of at least n different numbers.

Table of values

n a(n)
0 2
1 3
2 6
3 21
4 31
5 31
6 49
7 73
8 73
9 91
10 115
11 121
12 121
13 121
14 169
15 169
16 211
17 211
18 211
19 211
20 211
21 301
22 331
23 331
24 331
25 361
26 391
27 391
28 421
29 421
30 421
31 421
32 421
33 511
34 511
35 631
36 631
37 631
38 631
39 631
40 631
41 631
42 721
43 721
44 721
45 781
46 781
47 841
48 841
49 841
50 841
51 841
52 841
53 841
54 841

List of values

[2, 3, 6, 21, 31, 31, 49, 73, 73, 91, 115, 121, 121, 121, 169, 169, 211, 211, 211, 211, 211, 301, 331, 331, 331, 361, 391, 391, 421, 421, 421, 421, 421, 511, 511, 631, 631, 631, 631, 631, 631, 631, 721, 721, 721, 781, 781, 841, 841, 841, 841, 841, 841, 841, 841]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.