A069023 - cp's OEIS frontend

A069023 Define a subset of divisors of n to be a dedicated subset if the product of any two members is also a divisor of n. 1 is not allowed as a member as it gives trivially 1*d = d a divisor. a(n) is the number of dedicated subsets of divisors of n with at least two members.

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

[0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 3, 0, 1, 1, 2, 0, 3, 0, 3, 1, 1, 0, 9, 0, 1, 1, 3, 0, 7, 0, 5, 1, 1, 1, 9, 0, 1, 1, 9, 0, 7, 0, 3, 3, 1, 0, 17, 0, 3, 1, 3, 0, 9, 1, 9, 1, 1, 0, 20, 0, 1, 3, 8, 1, 7, 0, 3, 1, 7, 0, 28, 0, 1, 3, 3, 1, 7, 0, 17, 2, 1, 0, 20, 1, 1, 1, 9, 0, 20, 1, 3, 1, 1, 1, 35, 0, 3, 3, 9, 0, 7]

cp's OEIS Frontend

A069023 Define a subset of divisors of n to be a dedicated subset if the product of any two members is also a divisor of n. 1 is not allowed as a member as it gives trivially 1*d = d a divisor. a(n) is the number of dedicated subsets of divisors of n with at least two members.

Table of values

List of values

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

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

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