A355738 - cp's OEIS frontend

A355738 Least k such that there are exactly n ways to choose a sequence of divisors, one of each prime index of k (with multiplicity), such that the result has no common divisor > 1.

n	a(n)
1	1
2	2
3	6
4	9
5	15
6	49
7	35
8	27
9	45
10	98
11	63
12	105
13	171
14	117
15	81
16	135
17	245
18	343
19	273
20	549
21	189
22	1083
23	315
24	5618
25	741
26	686
27	507
28	513
29	351
30	243
31	405
32	7467
33	6419
34	5575
35	735
36	6859
37	1813
38	3231
39	1183
40	1197
41	3537
42	819
43	1647
44	567
45	945
46	2197
47	8397
48	3211
49	1715
50	3249
51	3367

[1, 2, 6, 9, 15, 49, 35, 27, 45, 98, 63, 105, 171, 117, 81, 135, 245, 343, 273, 549, 189, 1083, 315, 5618, 741, 686, 507, 513, 351, 243, 405, 7467, 6419, 5575, 735, 6859, 1813, 3231, 1183, 1197, 3537, 819, 1647, 567, 945, 2197, 8397, 3211, 1715, 3249, 3367]

cp's OEIS Frontend

A355738 Least k such that there are exactly n ways to choose a sequence of divisors, one of each prime index of k (with multiplicity), such that the result has no common divisor > 1.

Table of values

List of values