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.

A353082 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 (a(n-1) + a(n-2))*|a(n-1) - a(n-2)|.

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 4
6 9
7 13
8 8
9 7
10 15
11 11
12 26
13 37
14 21
15 16
16 185
17 39
18 14
19 25
20 33
21 29
22 31
23 6
24 925
25 19
26 12
27 217
28 41
29 22
30 57
31 35
32 23
33 24
34 47
35 71
36 48
37 17
38 65
39 32
40 97
41 43
42 10
43 53
44 63
45 20
46 83
47 103
48 30
49 73
50 4429
51 18
52 401
53 383
54 28
55 137
56 55
57 64
58 51
59 115
60 128
61 27
62 101
63 74
64 45
65 119
66 82
67 67
68 149
69 36
70 113
71 77

List of values

[1, 2, 3, 5, 4, 9, 13, 8, 7, 15, 11, 26, 37, 21, 16, 185, 39, 14, 25, 33, 29, 31, 6, 925, 19, 12, 217, 41, 22, 57, 35, 23, 24, 47, 71, 48, 17, 65, 32, 97, 43, 10, 53, 63, 20, 83, 103, 30, 73, 4429, 18, 401, 383, 28, 137, 55, 64, 51, 115, 128, 27, 101, 74, 45, 119, 82, 67, 149, 36, 113, 77]