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.

A367491 Lexicographically least increasing sequence, starting with 2, such that no two terms (possibly identical) sum to a Fibonacci number.

Table of values

n a(n)
1 2
2 5
3 7
4 9
5 10
6 13
7 15
8 18
9 20
10 22
11 23
12 26
13 28
14 30
15 31
16 34
17 36
18 38
19 39
20 41
21 43
22 44
23 47
24 49
25 52
26 54
27 56
28 57
29 60
30 62
31 64
32 65
33 68
34 70
35 73
36 75
37 77
38 78
39 81
40 83
41 85
42 86
43 89
44 91
45 93
46 94
47 96
48 98
49 99
50 102
51 104
52 107
53 109
54 111
55 112
56 115
57 117
58 119
59 120
60 123
61 125
62 127
63 128

List of values

[2, 5, 7, 9, 10, 13, 15, 18, 20, 22, 23, 26, 28, 30, 31, 34, 36, 38, 39, 41, 43, 44, 47, 49, 52, 54, 56, 57, 60, 62, 64, 65, 68, 70, 73, 75, 77, 78, 81, 83, 85, 86, 89, 91, 93, 94, 96, 98, 99, 102, 104, 107, 109, 111, 112, 115, 117, 119, 120, 123, 125, 127, 128]