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.

A203075 Write n as a sum of distinct terms from A203074; if there is more than one way, choose the smallest binary number.

Table of values

n a(n)
0 0
1 1
2 10
3 11
4 101
5 110
6 111
7 1010
8 1011
9 1101
10 1110
11 1111
12 10001
13 10010
14 10011
15 10101
16 10110
17 10111
18 11010
19 11011
20 11101
21 11110
22 11111
23 100111
24 101010
25 101011
26 101101
27 101110
28 101111
29 110001
30 110010
31 110011
32 110101
33 110110
34 110111
35 111010
36 111011

List of values

[0, 1, 10, 11, 101, 110, 111, 1010, 1011, 1101, 1110, 1111, 10001, 10010, 10011, 10101, 10110, 10111, 11010, 11011, 11101, 11110, 11111, 100111, 101010, 101011, 101101, 101110, 101111, 110001, 110010, 110011, 110101, 110110, 110111, 111010, 111011]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.