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.

A275716 Permutation of natural numbers: a(0) = 1, a(1) = 2, a(2n) = A273669(a(n)), a(2n+1) = A273664(a(n)).

Original entry on oeis.org

1, 2, 9, 3, 42, 17, 12, 4, 209, 115, 82, 41, 59, 26, 19, 5, 1042, 801, 572, 444, 409, 283, 202, 57, 292, 180, 129, 48, 92, 31, 22, 6, 5209, 5603, 4002, 4881, 2859, 3106, 2219, 733, 2042, 1977, 1412, 620, 1009, 395, 282, 97, 1459, 1258, 899, 525, 642, 334, 239, 74, 459, 213, 152, 63, 109, 40, 29, 7, 26042, 39217
Offset: 0

Views

Author

Antti Karttunen, Aug 06 2016

Keywords

Comments

Note the indexing: the domain starts from 0, while the range excludes zero.
This sequence can be represented as a binary tree. Each left hand child is obtained by applying A273669(n) when the parent contains n, and each right hand child is obtained by applying A273664 to the parent's contents:
1
|
...................2...................
9 3
42......../ \........17 12......../ \........4
/ \ / \ / \ / \
/ \ / \ / \ / \
/ \ / \ / \ / \
209 115 82 41 59 26 19 5
1042 801 572 444 409 283 202 57 292 180 129 48 92 31 22 6
etc.

Crossrefs

Inverse: A275715.
Related or similar permutations: A163511, A249824, A245612.

Formula

a(0) = 1, a(1) = 2, a(2n) = A273669(a(n)), a(2n+1) = A273664(a(n)).
As a composition of other permutations:
a(n) = A249824(A163511(n)).