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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A267584 a(0)=1; thereafter a(n) = 2^(1 + number of zeros in binary expansion of n). 2
1, 2, 4, 2, 8, 4, 4, 2, 16, 8, 8, 4, 8, 4, 4, 2, 32, 16, 16, 8, 16, 8, 8, 4, 16, 8, 8, 4, 8, 4, 4, 2, 64, 32, 32, 16, 32, 16, 16, 8, 32, 16, 16, 8, 16, 8, 8, 4, 32, 16, 16, 8, 16, 8, 8, 4, 16, 8, 8, 4, 8, 4, 4, 2, 128, 64, 64, 32, 64, 32, 32, 16, 64 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

N. J. A. Sloane, Table of n, a(n) for n = 0..20000

FORMULA

For n >= 1, a(n) = 2^(1+A023416(n)).

EXAMPLE

12 = 1100 in binary, which contains two 0's, so a(12) = 2^3 = 8.

CROSSREFS

Partial sums give A064194.

Cf. A023416.

Sequence in context: A286596 A134066 A090988 * A278531 A095728 A279354

Adjacent sequences:  A267581 A267582 A267583 * A267585 A267586 A267587

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Jan 17 2016

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 February 22 15:52 EST 2019. Contains 320399 sequences. (Running on oeis4.)