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.

A352790 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number that has not appeared that is a divisor of either a(n-2)+a(n-1) or a(n-2)*a(n-1).

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 4
6 9
7 6
8 15
9 7
10 11
11 18
12 22
13 8
14 10
15 16
16 13
17 26
18 39
19 65
20 52
21 20
22 12
23 24
24 32
25 14
26 23
27 37
28 30
29 67
30 97
31 41
32 46
33 29
34 25
35 27
36 45
37 36
38 54
39 72
40 21
41 28
42 42
43 35
44 49
45 84
46 19
47 38
48 57
49 95
50 76
51 171
52 114
53 285
54 90
55 50
56 60
57 40
58 48
59 44
60 33
61 66
62 99
63 55
64 77
65 121
66 198
67 242
68 88
69 110
70 80
71 100
72 64
73 82
74 73

List of values

[1, 2, 3, 5, 4, 9, 6, 15, 7, 11, 18, 22, 8, 10, 16, 13, 26, 39, 65, 52, 20, 12, 24, 32, 14, 23, 37, 30, 67, 97, 41, 46, 29, 25, 27, 45, 36, 54, 72, 21, 28, 42, 35, 49, 84, 19, 38, 57, 95, 76, 171, 114, 285, 90, 50, 60, 40, 48, 44, 33, 66, 99, 55, 77, 121, 198, 242, 88, 110, 80, 100, 64, 82, 73]