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.

A361314 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number which has not appeared that shares a factor with a(n-2) + a(n-1) while the sum a(n) + a(n-1) is distinct from all previous sums a(i) + a(i-1), i=2..n-1.

Table of values

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

List of values

[1, 2, 3, 5, 4, 6, 8, 7, 9, 10, 19, 29, 12, 41, 53, 14, 67, 15, 16, 31, 47, 13, 20, 18, 22, 24, 26, 25, 17, 27, 28, 11, 21, 36, 30, 32, 38, 34, 39, 73, 35, 33, 42, 45, 48, 51, 44, 40, 46, 43, 89, 50, 139, 49, 52, 101, 54, 55, 109, 56, 57, 113, 58, 60, 59, 63, 61, 62, 66, 64, 65, 69, 68, 137, 70]