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.

Showing 1-3 of 3 results.

A075168 Position of A075170(n) in A014486.

Original entry on oeis.org

0, 1, 2, 3, 5, 4, 6, 7, 12, 11, 9, 10, 15, 14, 16, 8, 13, 30, 28, 29, 24, 23, 25, 26, 40, 39, 37, 38, 43, 42, 19, 18, 32, 33, 84, 85, 80, 79, 81, 82, 68, 67, 65, 66, 71, 70, 72, 27, 41, 114, 112, 113, 108, 107, 109, 110, 124, 123, 121, 122, 52, 51, 47, 17, 31, 89, 93, 94
Offset: 0

Views

Author

Antti Karttunen, Sep 13 2002

Keywords

Comments

See A075171.

Crossrefs

Inverse of A075169.

A075169 Position of A014486(n) in A075170.

Original entry on oeis.org

0, 1, 2, 3, 5, 4, 6, 7, 15, 10, 11, 9, 8, 16, 13, 12, 14, 63, 31, 30, 127, 255, 65535, 21, 20, 22, 23, 47, 18, 19, 17, 64, 32, 33, 128, 256, 65536, 26, 27, 25, 24, 48, 29, 28, 126, 2047, 4095, 62, 1023, 511, 131071, 61, 60, 254, 16383, 8191, 510, 32767
Offset: 0

Views

Author

Antti Karttunen, Sep 13 2002

Keywords

Comments

See A075171.

Crossrefs

Inverse of A075168.

A075171 Nonnegative integers mapped to Dyck path encodings of the rooted plane trees obtained by recursing on the run lengths of the binary expansion of n.

Original entry on oeis.org

0, 10, 1010, 1100, 101100, 101010, 110010, 110100, 10110100, 10110010, 10101010, 10101100, 11001100, 11001010, 11010010, 111000, 10111000, 1011010010, 1011001010, 1011001100, 1010101100, 1010101010, 1010110010, 1010110100
Offset: 0

Views

Author

Antti Karttunen, Sep 13 2002

Keywords

Examples

			The rooted plane trees encoded here are:
.....................o........o.........o......o...o...
.....................|........|.........|.......\./....
.......o....o...o....o....o...o..o.o.o..o...o....o.....
.......|.....\./.....|.....\./....\|/....\./.....|.....
(AT)......(AT)......(AT)......(AT)......(AT)......(AT)......(AT)......(AT).....
0......1......2......3......4......5......6......7.....
Note that we recurse on the run length - 1, thus for 4 = 100 in binary, we construct a tree by joining trees 0 (= 1-1) and 1 (= 2-1) respectively from left to right. For 5 (101) we construct a tree by joining three copies of tree 0 (a single leaf) with a new root node. For 6 (110) we join trees 1 and 0 to get a mirror image of tree 4. For 7 (111) we just add a new root node below tree 2.

Links

Crossrefs

Permutation of A063171. Same sequence shown in decimal: A075170. The digital length of each term / 2 (the number of o-nodes in the corresponding trees) is given by A075172. Cf. A075166, A007088.
Showing 1-3 of 3 results.

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

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