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.

A366110 a(n) is the difference between the maximum and minimum number whose proper divisors sum to n, or 0 if there is no such number.

Table of values

n a(n)
2 0
3 0
4 0
5 0
6 19
7 0
8 39
9 0
10 0
11 0
12 0
13 8
14 147
15 17
16 14
17 16
18 0
19 12
20 327
21 73
22 18
23 28
24 0
25 48
26 0
27 64
28 0
29 72
30 0
31 189
32 903
33 202
34 0
35 160
36 0
37 168
38 0
39 0
40 37
41 328
42 1651
43 387
44 1767
45 280
46 34
47 364
48 0
49 476
50 54
51 448
52 0
53 432
54 2767
55 677
56 0
57 604
58 0
59 432
60 0
61 528
62 3603
63 753
64 66
65 826
66 0
67 768
68 0
69 720
70 0

List of values

[0, 0, 0, 0, 19, 0, 39, 0, 0, 0, 0, 8, 147, 17, 14, 16, 0, 12, 327, 73, 18, 28, 0, 48, 0, 64, 0, 72, 0, 189, 903, 202, 0, 160, 0, 168, 0, 0, 37, 328, 1651, 387, 1767, 280, 34, 364, 0, 476, 54, 448, 0, 432, 2767, 677, 0, 604, 0, 432, 0, 528, 3603, 753, 66, 826, 0, 768, 0, 720, 0]