A355732 - cp's OEIS frontend

A355732 Least k such that there are exactly n ways to choose a sequence of divisors, one of each element of the multiset of prime indices of k (with multiplicity).

n	a(n)
1	1
2	3
3	7
4	9
5	53
6	21
7	311
8	27
9	49
10	159
11	8161
12	63
13	38873
14	933
15	371
16	81
17	147
18	477
19	2177
20	24483
21	189
22	2809
23	343
24	2799
25	1113
26	243
27	57127
28	16483
29	441
30	1431
31	6531
32	73449
33	2597
34	567
35	96721
36	8427
37	1029
38	8397
39	3339
40	15239
41	729
42	49449
43	1323
44	19663
45	4293
46	2401
47	19593
48	7791

[1, 3, 7, 9, 53, 21, 311, 27, 49, 159, 8161, 63, 38873, 933, 371, 81, 147, 477, 2177, 24483, 189, 2809, 343, 2799, 1113, 243, 57127, 16483, 441, 1431, 6531, 73449, 2597, 567, 96721, 8427, 1029, 8397, 3339, 15239, 729, 49449, 1323, 19663, 4293, 2401, 19593, 7791]

cp's OEIS Frontend

A355732 Least k such that there are exactly n ways to choose a sequence of divisors, one of each element of the multiset of prime indices of k (with multiplicity).

Table of values

List of values