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.

A364164 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number that has not yet appeared that has the same number of distinct prime factors as the sum of all previous terms.

Table of values

n a(n)
1 1
2 2
3 3
4 6
5 10
6 12
7 14
8 15
9 18
10 4
11 20
12 30
13 21
14 42
15 60
16 66
17 22
18 24
19 70
20 78
21 84
22 90
23 26
24 28
25 33
26 34
27 35
28 36
29 102
30 105
31 5
32 38
33 110
34 39
35 7
36 210
37 114
38 120
39 126
40 330
41 390
42 420
43 130
44 132
45 138
46 140
47 462
48 510
49 150
50 546
51 570
52 154
53 40
54 44
55 45
56 156
57 8
58 165
59 630
60 660
61 168
62 170
63 174
64 9
65 46
66 48
67 690

List of values

[1, 2, 3, 6, 10, 12, 14, 15, 18, 4, 20, 30, 21, 42, 60, 66, 22, 24, 70, 78, 84, 90, 26, 28, 33, 34, 35, 36, 102, 105, 5, 38, 110, 39, 7, 210, 114, 120, 126, 330, 390, 420, 130, 132, 138, 140, 462, 510, 150, 546, 570, 154, 40, 44, 45, 156, 8, 165, 630, 660, 168, 170, 174, 9, 46, 48, 690]