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.

A361824 Sum of odd middle divisors of n, where "middle divisor" means a divisor in the half-open interval [sqrt(n/2), sqrt(n*2)).

Table of values

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

List of values

[1, 1, 0, 0, 0, 3, 0, 0, 3, 0, 0, 3, 0, 0, 8, 0, 0, 3, 0, 5, 0, 0, 0, 0, 5, 0, 0, 7, 0, 5, 0, 0, 0, 0, 12, 0, 0, 0, 0, 5, 0, 7, 0, 0, 14, 0, 0, 0, 7, 5, 0, 0, 0, 9, 0, 7, 0, 0, 0, 0, 0, 0, 16, 0, 0, 11, 0, 0, 0, 7, 0, 9, 0, 0, 0, 0, 18, 0, 0, 0, 9, 0, 0, 7, 0, 0, 0, 11, 0, 9, 20, 0, 0, 0, 0, 0, 0, 7, 20, 0]