OFFSET
1,2
COMMENTS
Permutation obtained from the Lucky sieve.
This sequence can be represented as a binary tree. For n > 2, each left hand child is obtained by doubling the contents of the parent node and subtracting one, and each right hand child is obtained by applying A269372(n), when the parent node contains n:
1
|
...................2...................
3 6
5......../ \........4 11......../ \........8
/ \ / \ / \ / \
/ \ / \ / \ / \
/ \ / \ / \ / \
9 10 7 18 21 28 15 12
17 22 19 38 13 16 35 26 41 58 55 102 29 40 23 14
etc.
LINKS
FORMULA
PROG
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Antti Karttunen, Mar 01 2016
STATUS
approved