The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS For any node n >= 2 in binary trees like A332815, a(n) gives the parent node of n. LINKS Antti Karttunen, Table of n, a(n) for n = 1..65537 FORMULA a(1) = 1, after which a(n) = n/2 for even n, and a(n) = A332819(n) for odd n. PROG (PARI) A332819(n) = A108548(A064989(A332808(n))); A332893(n) = if(1==n, n, if(!(n%2), n/2, A332819(n))); CROSSREFS Cf. A332815, A332819, A332894. Cf. also A252463. Sequence in context: A332825 A253554 A252463 * A113605 A342515 A307815 Adjacent sequences: A332890 A332891 A332892 * A332894 A332895 A332896 KEYWORD nonn AUTHOR Antti Karttunen, Mar 01 2020 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 30 12:56 EST 2023. Contains 359945 sequences. (Running on oeis4.)