The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A265158 a(1) = 1, a(2*n) = 2*a(n), a(2*n+1) = floor(a(n)/2). 2
 1, 2, 0, 4, 1, 0, 0, 8, 2, 2, 0, 0, 0, 0, 0, 16, 4, 4, 1, 4, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 32, 8, 8, 2, 8, 2, 2, 0, 8, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 64, 16, 16, 4, 16, 4, 4, 1, 16, 4, 4, 1, 4, 1, 0, 0, 16, 4, 4, 1, 4, 1, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS All terms are either zero or a power of 2; a(2^k) = 2^k; for k > 1: a(2^k+1) = 2^(k-2); a(2^k-1) = 0; A264784 gives lengths of runs of zeros. LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..2047 PROG (Haskell) import Data.List (transpose) a265158 n = a265158_list !! (n-1) a265158_list = 1 : concat    (transpose [map (* 2) a265158_list, map (flip div 2) a265158_list]) CROSSREFS Cf. A000051, A000079, A000225, A131577, A264784. Sequence in context: A019215 A326799 A112081 * A210444 A226949 A166589 Adjacent sequences:  A265155 A265156 A265157 * A265159 A265160 A265161 KEYWORD nonn AUTHOR Reinhard Zumkeller, Dec 04 2015 STATUS approved

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

Last modified December 1 16:44 EST 2021. Contains 349430 sequences. (Running on oeis4.)