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.

A367082 a(1), a(2) = 2. Thereafter a(n) is the least novel multiple of the greatest prime which divides precisely one of a(n-1), a(n-2) but not the other. If no such prime exists a(n) is the least novel multiple of the smallest prime dividing neither a(n-1) nor a(n-2).

Table of values

n a(n)
1 1
2 2
3 4
4 3
5 6
6 8
7 9
8 12
9 10
10 5
11 14
12 7
13 16
14 21
15 28
16 15
17 35
18 42
19 20
20 49
21 56
22 18
23 63
24 70
25 25
26 77
27 11
28 84
29 22
30 33
31 24
32 44
33 55
34 30
35 66
36 88
37 27
38 99
39 110
40 40
41 121
42 132
43 36
44 143
45 13
46 154
47 26
48 39
49 45
50 52
51 65
52 50
53 78
54 91
55 98
56 104
57 117
58 48
59 130
60 156
61 60
62 169
63 182
64 105
65 195
66 208
67 75
68 221
69 17
70 234
71 34
72 51
73 54
74 68
75 85
76 80
77 102
78 119

List of values

[1, 2, 4, 3, 6, 8, 9, 12, 10, 5, 14, 7, 16, 21, 28, 15, 35, 42, 20, 49, 56, 18, 63, 70, 25, 77, 11, 84, 22, 33, 24, 44, 55, 30, 66, 88, 27, 99, 110, 40, 121, 132, 36, 143, 13, 154, 26, 39, 45, 52, 65, 50, 78, 91, 98, 104, 117, 48, 130, 156, 60, 169, 182, 105, 195, 208, 75, 221, 17, 234, 34, 51, 54, 68, 85, 80, 102, 119]