cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A355734 Least k such that there are exactly n multisets that can be obtained by choosing a divisor of each prime index of k.

Table of values

n a(n)
1 1
2 3
3 7
4 13
5 21
6 35
7 39
8 89
9 133
10 105
11 91
12 195
13 351
14 285
15 247
16 333
17 273
18 481
19 455
20 555
21 623
22 801
23 791
24 741
25 1359
26 1157
27 1281
28 1335
29 1365
30 1443
31 1977
32 1729
33 1967
34 1869
35 2109
36 3185
37 2373
38 2769
39 2639
40 4361
41 3367
42 3653
43 3885
44 3471
45 4613
46 5883
47 5187
48 5551
49 6327

List of values

[1, 3, 7, 13, 21, 35, 39, 89, 133, 105, 91, 195, 351, 285, 247, 333, 273, 481, 455, 555, 623, 801, 791, 741, 1359, 1157, 1281, 1335, 1365, 1443, 1977, 1729, 1967, 1869, 2109, 3185, 2373, 2769, 2639, 4361, 3367, 3653, 3885, 3471, 4613, 5883, 5187, 5551, 6327]