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.

A362802 a(n) is the number of ways in which the set of divisors of n can be partitioned into disjoint parts, all of length > 1 and with integer harmonic mean.

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 1
13 0
14 0
15 0
16 0
17 0
18 1
19 0
20 0
21 0
22 0
23 0
24 4
25 0
26 0
27 0
28 1
29 0
30 3
31 0
32 0
33 0
34 0
35 0
36 0
37 0
38 0
39 0
40 1
41 0
42 1
43 0
44 0
45 1
46 0
47 0
48 15
49 0
50 0
51 0
52 0
53 0
54 3
55 0
56 1
57 0
58 0
59 0
60 175
61 0
62 0
63 0
64 0
65 0
66 2
67 0
68 0
69 0
70 0
71 0
72 78
73 0
74 0
75 0
76 0
77 0
78 1
79 0
80 0
81 0
82 0
83 0
84 188
85 0

List of values

[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 4, 0, 0, 0, 1, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 15, 0, 0, 0, 0, 0, 3, 0, 1, 0, 0, 0, 175, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 78, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 188, 0]