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.

A048138 a(n) = number of m such that sum of proper divisors of m (A001065(m)) is n.

Table of values

n a(n)
2 0
3 1
4 1
5 0
6 2
7 1
8 2
9 1
10 1
11 1
12 1
13 2
14 2
15 2
16 2
17 2
18 1
19 2
20 2
21 3
22 2
23 2
24 1
25 3
26 1
27 2
28 1
29 2
30 1
31 5
32 2
33 3
34 1
35 3
36 1
37 4
38 1
39 1
40 3
41 4
42 2
43 5
44 2
45 3
46 2
47 3
48 1
49 6
50 2
51 4
52 0
53 3
54 2
55 6
56 1
57 5
58 1
59 3
60 1
61 6
62 2
63 3
64 3
65 6
66 1
67 6
68 1
69 2
70 1
71 5
72 1
73 8
74 3
75 4
76 3
77 5
78 1
79 7
80 1
81 6
82 1
83 4
84 1
85 8
86 1
87 5
88 0
89 5
90 2
91 9
92 2
93 4
94 1
95 4
96 0
97 9
98 1
99 3
100 2
101 6
102 1
103 8
104 2
105 7
106 4

List of values

[0, 1, 1, 0, 2, 1, 2, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 2, 2, 3, 2, 2, 1, 3, 1, 2, 1, 2, 1, 5, 2, 3, 1, 3, 1, 4, 1, 1, 3, 4, 2, 5, 2, 3, 2, 3, 1, 6, 2, 4, 0, 3, 2, 6, 1, 5, 1, 3, 1, 6, 2, 3, 3, 6, 1, 6, 1, 2, 1, 5, 1, 8, 3, 4, 3, 5, 1, 7, 1, 6, 1, 4, 1, 8, 1, 5, 0, 5, 2, 9, 2, 4, 1, 4, 0, 9, 1, 3, 2, 6, 1, 8, 2, 7, 4]