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.

A005653 Lexicographically least increasing sequence, starting with 2, such that the sum of two distinct terms of the sequence is never a Fibonacci number.

Table of values

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

List of values

[2, 4, 5, 7, 10, 12, 13, 15, 18, 20, 23, 25, 26, 28, 31, 33, 34, 36, 38, 39, 41, 44, 46, 47, 49, 52, 54, 57, 59, 60, 62, 65, 67, 68, 70, 72, 73, 75, 78, 80, 81, 83, 86, 88, 89, 91, 93, 94, 96, 99, 101, 102, 104, 107, 109, 112, 114, 115, 117, 120, 122, 123, 125, 127, 128]