A325809 - cp's OEIS frontend

A325809 Let k = A228058(n). a(n) is the number of ways to partition the divisors of k into complementary subsets x and y so that the (k-Sum(x)) and (k-Sum(y)) are coprime.

n	a(n)
1	8
2	12
3	8
4	16
5	8
6	15
7	16
8	8
9	113
10	16
11	8
12	15
13	16
14	7
15	14
16	8
17	8
18	13
19	16
20	15
21	8
22	15
23	14
24	8
25	15
26	254
27	8
28	16
29	8
30	128
31	16
32	16
33	16
34	15
35	8
36	15
37	16
38	15
39	8
40	16
41	13
42	15
43	7
44	13
45	16
46	8
47	16
48	43008
49	8
50	8
51	126
52	8
53	15
54	15
55	15
56	8
57	16
58	8
59	14
60	8
61	15
62	16
63	8
64	16
65	60672
66	15
67	256
68	13
69	16
70	7
71	103
72	16
73	16
74	8
75	16
76	16
77	16
78	8
79	2015
80	16
81	8
82	15
83	16
84	39093
85	16

[8, 12, 8, 16, 8, 15, 16, 8, 113, 16, 8, 15, 16, 7, 14, 8, 8, 13, 16, 15, 8, 15, 14, 8, 15, 254, 8, 16, 8, 128, 16, 16, 16, 15, 8, 15, 16, 15, 8, 16, 13, 15, 7, 13, 16, 8, 16, 43008, 8, 8, 126, 8, 15, 15, 15, 8, 16, 8, 14, 8, 15, 16, 8, 16, 60672, 15, 256, 13, 16, 7, 103, 16, 16, 8, 16, 16, 16, 8, 2015, 16, 8, 15, 16, 39093, 16]

cp's OEIS Frontend

A325809 Let k = A228058(n). a(n) is the number of ways to partition the divisors of k into complementary subsets x and y so that the (k-Sum(x)) and (k-Sum(y)) are coprime.

Table of values

List of values