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.

A375029 Lexicographically least increasing sequence such that for any prime number p, any run of consecutive multiples of p has length exactly 2.

Table of values

n a(n)
1 1
2 2
3 4
4 5
5 10
6 12
7 15
8 20
9 22
10 33
11 36
12 38
13 57
14 60
15 70
16 77
17 88
18 90
19 105
20 112
21 114
22 171
23 172
24 258
25 261
26 290
27 300
28 303
29 404
30 406
31 609
32 612
33 646
34 665
35 700
36 702
37 741
38 760
39 770
40 847
41 848
42 954
43 957
44 1276
45 1278
46 1491
47 1498
48 1712
49 1713
50 3426
51 3428
52 4285
53 4290
54 5148

List of values

[1, 2, 4, 5, 10, 12, 15, 20, 22, 33, 36, 38, 57, 60, 70, 77, 88, 90, 105, 112, 114, 171, 172, 258, 261, 290, 300, 303, 404, 406, 609, 612, 646, 665, 700, 702, 741, 760, 770, 847, 848, 954, 957, 1276, 1278, 1491, 1498, 1712, 1713, 3426, 3428, 4285, 4290, 5148]