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.

A275693 Lexicographically earliest increasing sequence such that the a(n)th term of the sequence has n noncomposite divisors.

Table of values

n a(n)
1 1
2 2
3 4
4 6
5 7
6 30
7 210
8 211
9 212
10 213
11 214
12 215
13 216
14 217
15 218
16 219
17 220
18 221
19 222
20 223
21 224
22 225
23 226
24 227
25 228
26 229
27 230
28 231
29 232
30 2310
31 2311
32 2312
33 2313
34 2314
35 2315
36 2316
37 2317
38 2318
39 2319
40 2320
41 2321
42 2322
43 2323
44 2324
45 2325
46 2326
47 2327
48 2328
49 2329
50 2330

List of values

[1, 2, 4, 6, 7, 30, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 2310, 2311, 2312, 2313, 2314, 2315, 2316, 2317, 2318, 2319, 2320, 2321, 2322, 2323, 2324, 2325, 2326, 2327, 2328, 2329, 2330]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.