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.

A003714 Fibbinary numbers: if n = F(i1) + F(i2) + ... + F(ik) is the Zeckendorf representation of n (i.e., write n in Fibonacci number system) then a(n) = 2^(i1 - 2) + 2^(i2 - 2) + ... + 2^(ik - 2). Also numbers whose binary representation contains no two adjacent 1's.

Table of values

n a(n)
0 0
1 1
2 2
3 4
4 5
5 8
6 9
7 10
8 16
9 17
10 18
11 20
12 21
13 32
14 33
15 34
16 36
17 37
18 40
19 41
20 42
21 64
22 65
23 66
24 68
25 69
26 72
27 73
28 74
29 80
30 81
31 82
32 84
33 85
34 128
35 129
36 130
37 132
38 133
39 136
40 137
41 138
42 144
43 145
44 146
45 148
46 149
47 160
48 161
49 162
50 164
51 165
52 168
53 169
54 170
55 256
56 257
57 258
58 260
59 261
60 264

List of values

[0, 1, 2, 4, 5, 8, 9, 10, 16, 17, 18, 20, 21, 32, 33, 34, 36, 37, 40, 41, 42, 64, 65, 66, 68, 69, 72, 73, 74, 80, 81, 82, 84, 85, 128, 129, 130, 132, 133, 136, 137, 138, 144, 145, 146, 148, 149, 160, 161, 162, 164, 165, 168, 169, 170, 256, 257, 258, 260, 261, 264]