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.

A057520 a(n) = A014486(n)/2. In binary expansion there is one more 1 than 0 and reading from the left (the most significant bit) to right, the number of 0's never exceed the number of 1's.

Table of values

n a(n)
0 0
1 1
2 5
3 6
4 21
5 22
6 25
7 26
8 28
9 85
10 86
11 89
12 90
13 92
14 101
15 102
16 105
17 106
18 108
19 113
20 114
21 116
22 120
23 341
24 342
25 345
26 346
27 348
28 357
29 358
30 361
31 362
32 364
33 369
34 370
35 372
36 376
37 405
38 406
39 409
40 410
41 412
42 421
43 422
44 425
45 426
46 428
47 433
48 434
49 436
50 440
51 453
52 454
53 457
54 458
55 460

List of values

[0, 1, 5, 6, 21, 22, 25, 26, 28, 85, 86, 89, 90, 92, 101, 102, 105, 106, 108, 113, 114, 116, 120, 341, 342, 345, 346, 348, 357, 358, 361, 362, 364, 369, 370, 372, 376, 405, 406, 409, 410, 412, 421, 422, 425, 426, 428, 433, 434, 436, 440, 453, 454, 457, 458, 460]