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.

A383147 Sum of odd divisors m of n such that there is a divisor d of n with d < m < 2*d.

Table of values

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

List of values

[0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 3, 0, 0, 5, 0, 0, 12, 0, 5, 0, 0, 0, 3, 0, 0, 0, 7, 0, 23, 0, 0, 0, 0, 7, 12, 0, 0, 0, 5, 0, 31, 0, 0, 29, 0, 0, 3, 0, 0, 0, 0, 0, 39, 0, 7, 0, 0, 0, 23, 0, 0, 9, 0, 0, 47, 0, 0, 0, 7, 0, 12, 0, 0, 30, 0, 11, 42, 0, 5, 0, 0, 0, 31, 0, 0, 0, 11, 0, 77, 13, 0, 0, 0, 0]