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.

A363504 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number that has not yet appeared that is a multiple of prime(Omega(a(n-1))).

Table of values

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

List of values

[1, 2, 4, 3, 6, 9, 12, 5, 8, 10, 15, 18, 20, 25, 21, 24, 7, 14, 27, 30, 35, 33, 36, 28, 40, 42, 45, 50, 55, 39, 48, 11, 16, 49, 51, 54, 56, 63, 60, 70, 65, 57, 66, 75, 80, 22, 69, 72, 44, 85, 78, 90, 77, 81, 84, 91, 87, 93, 96, 13, 26, 99, 95, 102, 100, 98, 105, 110, 115, 108, 88, 112, 121, 111]