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.

A325806 Number of ways to partition the divisors of n into two complementary sets whose sums are relatively prime. (Here only distinct unordered pairs of such subsets are counted.)

Table of values

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

List of values

[1, 1, 1, 3, 1, 2, 1, 4, 3, 3, 1, 13, 1, 2, 2, 15, 1, 15, 1, 9, 4, 3, 1, 33, 3, 2, 4, 12, 1, 40, 1, 18, 2, 3, 4, 201, 1, 2, 4, 33, 1, 40, 1, 9, 7, 3, 1, 245, 3, 20, 2, 15, 1, 25, 4, 34, 4, 3, 1, 577, 1, 2, 15, 63, 4, 40, 1, 9, 2, 44, 1, 951, 1, 2, 15, 10, 4, 34, 1, 164, 15, 3, 1, 864, 4, 2, 2, 34, 1, 592, 2, 9, 4, 3, 2, 577, 1, 21, 7, 210, 1, 40, 1, 29, 40]