OFFSET
1,2
COMMENTS
This sequence can be represented as a binary tree. When the parent contains n, the left hand child contains 2n, while the value of right hand child is obtained by applying A250469(1+n):
1
|
................../ \..................
2 3
4......../ \........5 6......../ \........9
/ \ / \ / \ / \
/ \ / \ / \ / \
/ \ / \ / \ / \
8 7 10 15 12 11 18 27
16 25 14 21 20 13 30 45 24 17 22 33 36 23 54 81
etc.
Note how all nodes with odd n have a right hand child with value 3n.
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..6142
Antti Karttunen, Entanglement Permutations, 2016-2017
FORMULA
a(1) = 1, a(2n) = 2*a(n), a(2n+1) = A250469(1+a(n)).
PROG
CROSSREFS
KEYWORD
AUTHOR
Antti Karttunen, Mar 12 2016
STATUS
approved