A323710 - cp's OEIS frontend

A323710 a(n) is the symmetrical of n via transport of structure from binary trees, where the binary tree of n is built as follows: create a root with value n and recursively apply the rule {write node's value as (2^c)(2k+1); if c>0, create a left child with value c; if k>0, create a right child with value k}.

n	a(n)
1	1
2	3
3	2
4	7
5	8
6	6
7	4
8	5
9	128
10	24
11	256
12	14
13	64
14	12
15	16
16	15
17	32
18	384
19	340282366920938463463374607431768211456
20	56
21	16777216
22	768
23	115792089237316195423570985008687907853269984665640564039457584007913129639936
24	10
25	16384
26	192
27	18446744073709551616
28	28
29	4096
30	48

[1, 3, 2, 7, 8, 6, 4, 5, 128, 24, 256, 14, 64, 12, 16, 15, 32, 384, 340282366920938463463374607431768211456, 56, 16777216, 768, 115792089237316195423570985008687907853269984665640564039457584007913129639936, 10, 16384, 192, 18446744073709551616, 28, 4096, 48]

cp's OEIS Frontend

Table of values

List of values