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.

A334866 a(0) = 1, and then after, a(2n) = a(n)^2, a(2n+1) = A334747(a(n)).

Original entry on oeis.org

1, 2, 4, 3, 16, 8, 9, 6, 256, 32, 64, 12, 81, 18, 36, 5, 65536, 512, 1024, 48, 4096, 128, 144, 24, 6561, 162, 324, 27, 1296, 72, 25, 10, 4294967296, 131072, 262144, 768, 1048576, 2048, 2304, 96, 16777216, 8192, 16384, 192, 20736, 288, 576, 20, 43046721, 13122, 26244, 243, 104976, 648, 729, 54, 1679616, 2592, 5184, 108, 625, 50, 100, 15
Offset: 0

Views

Author

Antti Karttunen, Jun 08 2020

Keywords

Comments

This irregular table can be represented as a binary tree. Each child to the left is obtained by squaring the parent, and each child to the right is obtained by applying A334747 to the parent:
1
|
...................2...................
4 3
16......../ \........8 9......../ \........6
/ \ / \ / \ / \
/ \ / \ / \ / \
/ \ / \ / \ / \
256 32 64 12 81 18 36 5
65536 512 1024 48 4096 128 144 24 6561 162 324 27 1296 72 25 10
etc.
This is the mirror image of the tree in A334860.

Crossrefs

Cf. A334865 (inverse permutation), A334860 (mirror image).
Composition of permutations A005940 and A225546.
Cf. A001146 (left edge of the tree), A019565 (right edge), A334110 (the left children of the right edge).

Programs

Formula

a(0) = 1, and then after, a(2n) = a(n)^2, a(2n+1) = A334747(a(n)).
a(n) = A225546(A005940(1+n)).
For all n >= 0, A048675(a(n)) = A087808(n).