login
A332893
a(1) = 1, a(2n) = n, a(2n+1) = A332819(2n+1).
8
1, 1, 2, 2, 3, 3, 5, 4, 4, 5, 13, 6, 7, 7, 6, 8, 11, 9, 17, 10, 10, 11, 29, 12, 9, 13, 8, 14, 19, 15, 37, 16, 26, 17, 15, 18, 23, 19, 14, 20, 31, 21, 41, 22, 12, 23, 53, 24, 25, 25, 22, 26, 43, 27, 39, 28, 34, 29, 61, 30, 47, 31, 20, 32, 21, 33, 73, 34, 58, 35, 89, 36, 59, 37, 18, 38, 65, 39, 97, 40, 16, 41, 101, 42, 33, 43, 38, 44, 67, 45, 35
OFFSET
1,3
COMMENTS
For any node n >= 2 in binary trees like A332815, a(n) gives the parent node of n.
LINKS
FORMULA
a(1) = 1, after which a(n) = n/2 for even n, and a(n) = A332819(n) for odd n.
PROG
(PARI)
A332893(n) = if(1==n, n, if(!(n%2), n/2, A332819(n)));
CROSSREFS
Cf. also A252463.
Sequence in context: A332825 A253554 A252463 * A113605 A369984 A342515
KEYWORD
nonn
AUTHOR
Antti Karttunen, Mar 01 2020
STATUS
approved