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.

A066330 Binary string which equals n when 1's, 2's, 4's and 8's bits have weights 1, 2, 4, 5 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 1000
6 1001
7 1010
8 1011
9 1100
10 1101
11 1110
12 1111
13 -1
14 -1
15 -1
16 10000
17 10001
18 10010
19 10011
20 10100
21 11000
22 11001
23 11010
24 11011
25 11100
26 11101
27 11110
28 11111
29 -1
30 -1
31 -1
32 100000
33 100001
34 100010
35 100011
36 100100
37 101000
38 101001
39 101010
40 101011
41 101100
42 101101
43 101110
44 101111
45 -1
46 -1
47 -1

List of values

[0, 1, 10, 11, 100, 1000, 1001, 1010, 1011, 1100, 1101, 1110, 1111, -1, -1, -1, 10000, 10001, 10010, 10011, 10100, 11000, 11001, 11010, 11011, 11100, 11101, 11110, 11111, -1, -1, -1, 100000, 100001, 100010, 100011, 100100, 101000, 101001, 101010, 101011, 101100, 101101, 101110, 101111, -1, -1, -1]