login
A267106
Permutation of natural numbers: a(1) = 1, a(2n) = A080148(a(n)), a(2n+1) = A080147(a(n)).
3
1, 2, 3, 4, 6, 5, 7, 8, 10, 11, 13, 9, 12, 14, 16, 15, 18, 19, 24, 20, 25, 23, 29, 17, 21, 22, 26, 27, 30, 31, 35, 28, 33, 34, 40, 36, 42, 46, 53, 38, 44, 47, 55, 43, 51, 54, 62, 32, 37, 39, 45, 41, 50, 48, 57, 49, 59, 56, 65, 58, 66, 67, 74, 52, 60, 63, 70, 64, 71, 76, 82, 69, 77, 83, 87, 91, 98, 101, 112, 73, 79
OFFSET
1,2
COMMENTS
This sequence can be represented as a binary tree. Each left hand child is produced as A080148(n), and each right hand child as A080147(n), when the parent node contains n:
|
...................1...................
2 3
4......../ \........6 5......../ \........7
/ \ / \ / \ / \
/ \ / \ / \ / \
/ \ / \ / \ / \
8 10 11 13 9 12 14 16
15 18 19 24 20 25 23 29 17 21 22 26 27 30 31 35
etc.
FORMULA
a(1) = 1, after which, a(2n) = A080148(a(n)), a(2n+1) = A080147(a(n)).
PROG
(Scheme, with memoization-macro definec)
(definec (A267106 n) (cond ((<= n 1) n) ((odd? n) (A080147 (A267106 (/ (- n 1) 2)))) (else (A080148 (A267106 (/ n 2))))))
CROSSREFS
Inverse: A267105.
Cf. also A267107.
Sequence in context: A332805 A332807 A373038 * A275119 A218252 A080541
KEYWORD
nonn,tabf
AUTHOR
Antti Karttunen, Feb 01 2016
STATUS
approved