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.

A380856 In the binary expansion of n, arrange bits row-wise in a binary tree which is complete except for the last row and then read those bits in pre-order.

Table of values

n a(n)
0 0
1 1
2 2
3 3
4 4
5 5
6 6
7 7
8 8
9 10
10 9
11 11
12 12
13 14
14 13
15 15
16 16
17 18
18 20
19 22
20 17
21 19
22 21
23 23
24 24
25 26
26 28
27 30
28 25
29 27
30 29
31 31
32 32
33 33
34 36
35 37
36 40
37 41
38 44
39 45
40 34
41 35
42 38
43 39
44 42
45 43
46 46
47 47
48 48
49 49
50 52
51 53
52 56
53 57
54 60
55 61
56 50
57 51
58 54
59 55
60 58
61 59
62 62
63 63
64 64
65 65
66 66
67 67
68 72

List of values

[0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 9, 11, 12, 14, 13, 15, 16, 18, 20, 22, 17, 19, 21, 23, 24, 26, 28, 30, 25, 27, 29, 31, 32, 33, 36, 37, 40, 41, 44, 45, 34, 35, 38, 39, 42, 43, 46, 47, 48, 49, 52, 53, 56, 57, 60, 61, 50, 51, 54, 55, 58, 59, 62, 63, 64, 65, 66, 67, 72]

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

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