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.

A370810 Numbers n such that only one set can be obtained by choosing a different divisor of each prime index of n.

Table of values

n a(n)
1 1
2 2
3 6
4 9
5 10
6 22
7 25
8 30
9 34
10 42
11 45
12 62
13 63
14 66
15 75
16 82
17 98
18 99
19 102
20 110
21 118
22 121
23 134
24 147
25 153
26 166
27 170
28 186
29 210
30 218
31 230
32 246
33 254
34 275
35 279
36 289
37 310
38 314
39 315
40 330
41 343
42 354
43 358
44 363
45 369
46 374
47 382
48 390
49 402
50 410
51 422
52 425
53 462
54 482
55 490
56 495

List of values

[1, 2, 6, 9, 10, 22, 25, 30, 34, 42, 45, 62, 63, 66, 75, 82, 98, 99, 102, 110, 118, 121, 134, 147, 153, 166, 170, 186, 210, 218, 230, 246, 254, 275, 279, 289, 310, 314, 315, 330, 343, 354, 358, 363, 369, 374, 382, 390, 402, 410, 422, 425, 462, 482, 490, 495]