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.

A368133 a(1,2,3) = 1,2,3; let j = a(n-1), M(n) = Product_{i = 1..n-2} { p a distinct prime: p | a(i), gcd(p, j) = 1 }. For n > 3, a(n) is the least novel multiple of M(n) if M(n) > 1; otherwise a(n) is the least novel multiple of A053669(j), the smallest prime which does not divide j.

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 20
11 15
12 8
13 30
14 7
15 60
16 14
17 45
18 28
19 75
20 42
21 25
22 84
23 35
24 18
25 70
26 21
27 40
28 63
29 50
30 105
31 16
32 210
33 11
34 420
35 22
36 315
37 44
38 525
39 66
40 140
41 33
42 280
43 99
44 350
45 132
46 175
47 198
48 245
49 264
50 385
51 24
52 770
53 27
54 1540
55 36
56 1155
57 26
58 2310
59 13
60 4620
61 39
62 3080

List of values

[1, 2, 3, 4, 6, 5, 12, 10, 9, 20, 15, 8, 30, 7, 60, 14, 45, 28, 75, 42, 25, 84, 35, 18, 70, 21, 40, 63, 50, 105, 16, 210, 11, 420, 22, 315, 44, 525, 66, 140, 33, 280, 99, 350, 132, 175, 198, 245, 264, 385, 24, 770, 27, 1540, 36, 1155, 26, 2310, 13, 4620, 39, 3080]