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.

A086568 Smallest number having as many distinct prime factors as n has prime factors, when counted with multiplicity.

Table of values

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

List of values

[1, 2, 2, 6, 2, 6, 2, 30, 6, 6, 2, 30, 2, 6, 6, 210, 2, 30, 2, 30, 6, 6, 2, 210, 6, 6, 30, 30, 2, 30, 2, 2310, 6, 6, 6, 210, 2, 6, 6, 210, 2, 30, 2, 30, 30, 6, 2, 2310, 6, 30, 6, 30, 2, 210, 6, 210, 6, 6, 2, 210, 2, 6, 30, 30030, 6, 30, 2, 30, 6, 30, 2, 2310, 2, 6, 30, 30, 6, 30, 2]