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.

A364246 a(1) = 1. Thereafter, a(n) is the least novel multiple of either prime(k+1) if rad(a(n-1)) = A002110(k), or Product_{prime q; q < gpf(a(n-1)); and q!|a(n-1)} q otherwise.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 6
6 5
7 12
8 10
9 9
10 8
11 15
12 14
13 30
14 7
15 60
16 21
17 20
18 18
19 25
20 24
21 35
22 36
23 40
24 27
25 16
26 33
27 70
28 39
29 770
30 42
31 45
32 22
33 105
34 26
35 1155
36 28
37 75
38 32
39 48
40 50
41 51
42 10010
43 54
44 55
45 84
46 65
47 462
48 80
49 57
50 170170
51 63
52 90
53 49
54 120
55 56
56 135
57 34
58 15015
59 38
60 255255
61 44
62 210

List of values

[1, 2, 3, 4, 6, 5, 12, 10, 9, 8, 15, 14, 30, 7, 60, 21, 20, 18, 25, 24, 35, 36, 40, 27, 16, 33, 70, 39, 770, 42, 45, 22, 105, 26, 1155, 28, 75, 32, 48, 50, 51, 10010, 54, 55, 84, 65, 462, 80, 57, 170170, 63, 90, 49, 120, 56, 135, 34, 15015, 38, 255255, 44, 210]