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.

A359557 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number which has not appeared such that all the distinct prime factors of a(n-2) + a(n-1) are factors of a(n).

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 4
6 6
7 10
8 8
9 12
10 20
11 14
12 34
13 18
14 26
15 22
16 24
17 46
18 70
19 58
20 16
21 74
22 30
23 52
24 82
25 134
26 36
27 170
28 206
29 94
30 60
31 154
32 214
33 92
34 102
35 194
36 148
37 114
38 262
39 188
40 90
41 278
42 138
43 78
44 42
45 120
46 48
47 84
48 66
49 150
50 54
51 204
52 258
53 462
54 180
55 642
56 822
57 366
58 132
59 498
60 210
61 354
62 282
63 318
64 240
65 186
66 426
67 306

List of values

[1, 2, 3, 5, 4, 6, 10, 8, 12, 20, 14, 34, 18, 26, 22, 24, 46, 70, 58, 16, 74, 30, 52, 82, 134, 36, 170, 206, 94, 60, 154, 214, 92, 102, 194, 148, 114, 262, 188, 90, 278, 138, 78, 42, 120, 48, 84, 66, 150, 54, 204, 258, 462, 180, 642, 822, 366, 132, 498, 210, 354, 282, 318, 240, 186, 426, 306]