The OEIS is supported by the many generous donors to the OEIS 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A102572 a(n) = floor(log_4(n)). 12
 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,16 LINKS FORMULA G.f.: (1/(1 - x))*Sum_{k>=1} x^(4^k). - Ilya Gutkovskiy, Jan 08 2017 PROG (Magma) [ Ilog(4, n) : n in [1..150] ]; (PARI) a(n)=#digits(n, 4)-1 \\ Twice as fast as a(n)=for(i=0, n, (n>>=2)||return(i)); the naïve code a(n)=log(n)\log(4) works for standard realprecision=28 only up to n=4^47-5 and it is slower by another factor 2. - M. F. Hasler, Mar 11 2015 (PARI) A102572(n)=logint(n, 4) \\ M. F. Hasler, Nov 07 2019 CROSSREFS Cf. A000523, A062153. Sequence in context: A356852 A285481 A282622 * A098391 A071702 A225541 Adjacent sequences: A102569 A102570 A102571 * A102573 A102574 A102575 KEYWORD nonn AUTHOR N. J. A. Sloane, Dec 23 2006 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 November 30 02:32 EST 2022. Contains 358431 sequences. (Running on oeis4.)