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.

A378233 a(1) = 1, a(2) = 2, let i = a(n-2), j = a(n-1). For n > 2, If i*j is a term in A055932, a(n) is the least novel multiple of the smallest prime which does not divide i*j. Otherwise a(n) is the least novel multiple of the greatest prime < Gpf(i*j) which does not divide i*j.

Table of values

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

List of values

[1, 2, 3, 5, 4, 6, 10, 7, 9, 15, 8, 14, 20, 12, 21, 25, 16, 18, 30, 28, 11, 35, 24, 22, 42, 40, 33, 49, 45, 26, 44, 56, 50, 27, 63, 55, 32, 70, 36, 66, 77, 60, 13, 88, 84, 65, 99, 91, 75, 110, 98, 39, 121, 105, 34, 52, 132, 112, 80, 48, 119, 78, 143, 126, 85, 104]