A355736 - cp's OEIS frontend

A355736 Least k such that there are exactly n ways to choose a divisor of each prime index of k (taken in weakly increasing order) such that the result is also weakly increasing.

n	a(n)
1	1
2	3
3	7
4	13
5	21
6	37
7	39
8	89
9	133
10	117
11	111
12	273
13	351
14	259
15	267
16	333
17	453
18	793
19	669
20	623
21	999
22	777
23	843
24	1491
25	1157
26	1561
27	2863
28	1443
29	1963
30	2331
31	1977
32	1869
33	2899
34	2529
35	3207
36	4107
37	3171
38	5073
39	4329
40	3653
41	4667
42	3471
43	7399
44	4613
45	7587
46	5931
47	7269
48	5889
49	7483

[1, 3, 7, 13, 21, 37, 39, 89, 133, 117, 111, 273, 351, 259, 267, 333, 453, 793, 669, 623, 999, 777, 843, 1491, 1157, 1561, 2863, 1443, 1963, 2331, 1977, 1869, 2899, 2529, 3207, 4107, 3171, 5073, 4329, 3653, 4667, 3471, 7399, 4613, 7587, 5931, 7269, 5889, 7483]

cp's OEIS Frontend

A355736 Least k such that there are exactly n ways to choose a divisor of each prime index of k (taken in weakly increasing order) such that the result is also weakly increasing.

Table of values

List of values