A325807 - cp's OEIS frontend

A325807 Number of ways to partition the divisors of n into complementary subsets x and y for which gcd(n-Sum(x), n-Sum(y)) = 1. (Here only distinct unordered pairs of such subsets are counted.)

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

[1, 2, 1, 4, 1, 1, 1, 8, 3, 4, 1, 16, 1, 4, 2, 16, 1, 16, 1, 16, 4, 4, 1, 40, 3, 3, 4, 1, 1, 40, 1, 32, 2, 4, 4, 244, 1, 4, 4, 48, 1, 40, 1, 16, 8, 3, 1, 220, 3, 27, 2, 10, 1, 32, 4, 64, 4, 4, 1, 672, 1, 4, 14, 64, 4, 40, 1, 13, 2, 64, 1, 1205, 1, 4, 16, 10, 4, 40, 1, 236, 15, 4, 1, 864, 4, 3, 2, 64, 1, 640, 2, 16, 4, 4, 2, 537, 1, 26, 8, 241, 1, 40, 1, 64, 40]

cp's OEIS Frontend

A325807 Number of ways to partition the divisors of n into complementary subsets x and y for which gcd(n-Sum(x), n-Sum(y)) = 1. (Here only distinct unordered pairs of such subsets are counted.)

Table of values

List of values