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.

A362015 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number that has not yet appeared that, given the list of primes that form the factors of all previous terms a(1)..a(n-1), is a multiple of the prime in that list which is a factor of the fewest previous terms. If two or more such primes exist the smallest is chosen.

Table of values

n a(n)
1 1
2 2
3 4
4 6
5 3
6 9
7 8
8 12
9 15
10 5
11 10
12 20
13 25
14 18
15 30
16 35
17 7
18 14
19 21
20 28
21 42
22 49
23 40
24 56
25 45
26 63
27 50
28 70
29 77
30 11
31 22
32 33
33 44
34 55
35 66
36 88
37 99
38 110
39 121
40 84
41 132
42 91
43 13
44 26
45 39
46 52
47 65
48 78
49 104
50 117
51 130
52 143
53 156
54 169
55 98
56 154
57 182
58 165
59 195
60 176
61 208
62 105
63 187
64 17
65 34
66 51
67 68
68 85
69 102
70 119
71 136

List of values

[1, 2, 4, 6, 3, 9, 8, 12, 15, 5, 10, 20, 25, 18, 30, 35, 7, 14, 21, 28, 42, 49, 40, 56, 45, 63, 50, 70, 77, 11, 22, 33, 44, 55, 66, 88, 99, 110, 121, 84, 132, 91, 13, 26, 39, 52, 65, 78, 104, 117, 130, 143, 156, 169, 98, 154, 182, 165, 195, 176, 208, 105, 187, 17, 34, 51, 68, 85, 102, 119, 136]