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.

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

Table of values

n a(n)
0 0
1 10
2 101
3 100
4 110
5 1001
6 1000
7 1010
8 1101
9 1100
10 1110
11 -1
12 -1
13 -1
14 -1
15 10001
16 10000
17 10010
18 10101
19 10100
20 10110
21 11001
22 11000
23 11010
24 11101
25 11100
26 11110
27 -1
28 -1
29 -1
30 -1
31 100001
32 100000
33 100010
34 100101
35 100100
36 100110
37 101001
38 101000
39 101010
40 101101
41 101100
42 101110
43 -1
44 -1
45 -1
46 -1
47 110001

List of values

[0, 10, 101, 100, 110, 1001, 1000, 1010, 1101, 1100, 1110, -1, -1, -1, -1, 10001, 10000, 10010, 10101, 10100, 10110, 11001, 11000, 11010, 11101, 11100, 11110, -1, -1, -1, -1, 100001, 100000, 100010, 100101, 100100, 100110, 101001, 101000, 101010, 101101, 101100, 101110, -1, -1, -1, -1, 110001]