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.

A359857 a(1) = 1, a(2) = 2, and let i,j represent a(n-2), a(n-1) respectively. For n > 2: If only one of i,j is prime, a(n) = least novel multiple of i+j. If i,j are both prime, a(n) = least novel multiple of i*j. If both i,j are nonprime, a(n) is least novel k prime to both i and j.

Table of values

n a(n)
1 1
2 2
3 3
4 6
5 9
6 5
7 14
8 19
9 33
10 52
11 7
12 59
13 413
14 472
15 11
16 483
17 494
18 17
19 511
20 528
21 13
22 541
23 7033
24 7574
25 15
26 23
27 38
28 61
29 99
30 160
31 29
32 189
33 218
34 25
35 21
36 4
37 31
38 35
39 66
40 37
41 103
42 3811
43 3914
44 27
45 41
46 68
47 109
48 177
49 286
50 43
51 329
52 372
53 53
54 425
55 478
56 39
57 47
58 86
59 133
60 45
61 8

List of values

[1, 2, 3, 6, 9, 5, 14, 19, 33, 52, 7, 59, 413, 472, 11, 483, 494, 17, 511, 528, 13, 541, 7033, 7574, 15, 23, 38, 61, 99, 160, 29, 189, 218, 25, 21, 4, 31, 35, 66, 37, 103, 3811, 3914, 27, 41, 68, 109, 177, 286, 43, 329, 372, 53, 425, 478, 39, 47, 86, 133, 45, 8]