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.

A378446 Inverse Möbius transform of A083206, where A083206(n) is the number of ways of partitioning the divisors of n into two disjoint sets with equal sum.

Table of values

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

List of values

[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 5, 0, 0, 0, 1, 0, 4, 0, 0, 0, 0, 0, 2, 0, 0, 0, 3, 0, 3, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 3, 0, 2, 0, 0, 0, 23, 0, 0, 0, 0, 0, 3, 0, 0, 0, 1, 0, 5, 0, 0, 0, 0, 0, 3, 0, 6, 0, 0, 0, 19, 0, 0, 0, 1, 0, 17, 0, 0, 0, 0, 0, 21, 0, 0, 0, 1, 0, 3, 0, 1, 0, 0, 0, 12]