login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A255308 Number of times you can apply log_2 to n until the result is not a power of 2. Here log_2 means the base 2 logarithm. 4
0, 1, 2, 0, 3, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Multiplicative because only powers of two have a nonzero value. - Andrew Howroyd, Jul 27 2018

LINKS

Antti Karttunen, Table of n, a(n) for n = 0..65537

FORMULA

a(n) = 1 + a(log_2(n)) if n is a power of 2, 0 otherwise.

PROG

(PARI) a(n) = if(n < 1, 0, my(e=valuation(n, 2)); if(n == 2^e, 1 + a(e), 0)) \\ Andrew Howroyd, Jul 27 2018

CROSSREFS

Cf. A209229, A255309.

One less than A293668.

Sequence in context: A209640 A080300 A116864 * A079302 A138806 A181105

Adjacent sequences:  A255305 A255306 A255307 * A255309 A255310 A255311

KEYWORD

nonn,easy,mult

AUTHOR

Paul Boddington, Feb 20 2015

EXTENSIONS

Extended up to a(128) by Antti Karttunen, Sep 30 2018

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 23 02:49 EDT 2019. Contains 321422 sequences. (Running on oeis4.)