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.

A337645 a(1)=2; thereafter, a(n) = smallest number with at least two different prime factors that is missing from A336957 after A336957(n) has been found.

Table of values

n a(n)
1 2
2 6
3 10
4 10
5 10
6 10
7 10
8 10
9 10
10 18
11 20
12 20
13 20
14 20
15 24
16 24
17 24
18 24
19 24
20 24
21 24
22 24
23 24
24 24
25 24
26 24
27 24
28 24
29 24
30 24
31 24
32 24
33 24
34 24
35 36
36 36
37 36
38 36
39 44
40 44
41 44
42 44
43 48
44 48
45 48
46 48
47 48
48 48
49 48
50 48
51 48
52 48
53 48
54 48
55 48
56 48
57 48
58 48
59 48
60 48
61 48
62 48
63 48
64 48
65 48
66 48
67 54

List of values

[2, 6, 10, 10, 10, 10, 10, 10, 10, 18, 20, 20, 20, 20, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 36, 36, 36, 36, 44, 44, 44, 44, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 54]