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.

A358026 Let G(n) = gcd(a(n-2),a(n-1)), a(1)=1, a(2)=2, a(3)=3. Thereafter if G(n) = 1, a(n) is the least novel m sharing a divisor with both a(n-2) and a(n-1). If G(n) > 1 and every prime divisor of a(n-1) also divides a(n-2), a(n) is the least m prime to both a(n-1) and a(n-2). Otherwise a(n) is the least novel multiple of any prime divisor of a(n-1) which does not divide a(n-2).

Table of values

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

List of values

[1, 2, 3, 6, 4, 5, 10, 8, 7, 14, 12, 9, 11, 33, 15, 20, 16, 13, 26, 18, 21, 28, 22, 44, 17, 34, 24, 27, 19, 57, 30, 25, 23, 115, 35, 42, 32, 29, 58, 36, 39, 52, 38, 76, 31, 62, 40, 45, 48, 46, 69, 51, 68, 50, 55, 66, 54, 37, 74, 56, 49, 41, 287, 63, 60, 64, 43]