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.

A066334 Binary string which equals n when 1's, 2's, 4's and 8's bits have weights 1, 2, 4, 2 respectively, while the other bits have their usual weights. -1 if no such string exists.

Table of values

n a(n)
0 0
1 1
2 10
3 11
4 100
5 101
6 110
7 111
8 1110
9 1111
10 -1
11 -1
12 -1
13 -1
14 -1
15 -1
16 10000
17 10001
18 10010
19 10011
20 10100
21 10101
22 10110
23 10111
24 11110
25 11111
26 -1
27 -1
28 -1
29 -1
30 -1
31 -1
32 100000
33 100001
34 100010
35 100011
36 100100
37 100101
38 100110
39 100111
40 101110
41 101111
42 -1
43 -1
44 -1
45 -1
46 -1
47 -1
48 110000
49 110001
50 110010
51 110011

List of values

[0, 1, 10, 11, 100, 101, 110, 111, 1110, 1111, -1, -1, -1, -1, -1, -1, 10000, 10001, 10010, 10011, 10100, 10101, 10110, 10111, 11110, 11111, -1, -1, -1, -1, -1, -1, 100000, 100001, 100010, 100011, 100100, 100101, 100110, 100111, 101110, 101111, -1, -1, -1, -1, -1, -1, 110000, 110001, 110010, 110011]