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.

A351001 a(0) = 0, a(1) = 1; for n > 1, a(n) is the smallest positive number which has not appeared which has a common factor with a(n-2) + a(n-1) but does not equal a(n-2) + a(n-1).

Table of values

n a(n)
0 0
1 1
2 2
3 6
4 4
5 5
6 3
7 10
8 26
9 8
10 12
11 14
12 13
13 9
14 11
15 15
16 16
17 62
18 18
19 20
20 19
21 21
22 22
23 86
24 24
25 25
26 7
27 28
28 30
29 29
30 118
31 27
32 35
33 31
34 32
35 33
36 39
37 34
38 146
39 36
40 38
41 37
42 40
43 42
44 41
45 166
46 23
47 45
48 17
49 44
50 122
51 46
52 48
53 47
54 50
55 194
56 52
57 51
58 206
59 514
60 54
61 56
62 55
63 57
64 49
65 53
66 58
67 60
68 59
69 63
70 61
71 64

List of values

[0, 1, 2, 6, 4, 5, 3, 10, 26, 8, 12, 14, 13, 9, 11, 15, 16, 62, 18, 20, 19, 21, 22, 86, 24, 25, 7, 28, 30, 29, 118, 27, 35, 31, 32, 33, 39, 34, 146, 36, 38, 37, 40, 42, 41, 166, 23, 45, 17, 44, 122, 46, 48, 47, 50, 194, 52, 51, 206, 514, 54, 56, 55, 57, 49, 53, 58, 60, 59, 63, 61, 64]