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.

A353026 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number that has not appeared that is a multiple of the smallest prime factor with minimal exponent of a(n-1) (cf. A067695).

Table of values

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

List of values

[1, 2, 4, 6, 8, 10, 12, 3, 9, 15, 18, 14, 16, 20, 5, 25, 30, 22, 24, 21, 27, 33, 36, 26, 28, 7, 35, 40, 45, 50, 32, 34, 38, 42, 44, 11, 55, 60, 39, 48, 51, 54, 46, 52, 13, 65, 70, 56, 49, 63, 77, 84, 57, 66, 58, 62, 64, 68, 17, 85, 75, 69, 72, 78, 74, 76, 19, 95, 80, 90, 82, 86, 88, 99, 110]