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.

A357994 a(1)=1, a(2)=2. Thereafter, if there are prime divisors p of a(n-1) which do not divide a(n-2), a(n) is the greatest least multiple of any such p which has not already occurred. Otherwise a(n) is the least novel multiple of the squarefree kernel of a(n-1). (see comments).

Table of values

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

List of values

[1, 2, 4, 6, 3, 9, 12, 8, 10, 5, 15, 18, 14, 7, 21, 24, 16, 20, 25, 30, 27, 33, 11, 22, 26, 13, 39, 36, 28, 35, 40, 32, 34, 17, 51, 42, 49, 56, 38, 19, 57, 45, 50, 44, 55, 60, 48, 54, 66, 77, 63, 69, 23, 46, 52, 65, 70, 84, 72, 78, 91, 98, 58, 29, 87, 75, 80, 62]