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.

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

Table of values

n a(n)
1 1
2 3
3 6
4 8
5 9
6 11
7 14
8 16
9 17
10 19
11 21
12 22
13 24
14 27
15 29
16 30
17 32
18 35
19 37
20 40
21 42
22 43
23 45
24 48
25 50
26 51
27 53
28 55
29 56
30 58
31 61
32 63
33 64
34 66
35 69
36 71
37 74
38 76
39 77
40 79
41 82
42 84
43 85
44 87
45 90
46 92
47 95
48 97
49 98
50 100
51 103
52 105
53 106
54 108
55 110
56 111
57 113
58 116
59 118
60 119
61 121
62 124
63 126
64 129
65 131

List of values

[1, 3, 6, 8, 9, 11, 14, 16, 17, 19, 21, 22, 24, 27, 29, 30, 32, 35, 37, 40, 42, 43, 45, 48, 50, 51, 53, 55, 56, 58, 61, 63, 64, 66, 69, 71, 74, 76, 77, 79, 82, 84, 85, 87, 90, 92, 95, 97, 98, 100, 103, 105, 106, 108, 110, 111, 113, 116, 118, 119, 121, 124, 126, 129, 131]