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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089050 Number of ways of writing n as a sum of exactly 5 powers of 2. 9

%I #5 Oct 01 2018 10:16:50

%S 0,0,0,0,0,1,1,1,2,2,2,2,3,2,3,3,3,2,3,2,4,3,4,3,4,2,4,3,4,3,4,1,3,2,

%T 3,2,5,3,4,3,5,3,5,3,5,3,4,1,4,2,4,3,5,3,4,1,4,3,4,1,4,1,1,0,3,2,3,2,

%U 5,3,4,3,6,3,5,3,5,3,4,1,5,3,5,3,6,3,4,1,5,3,4,1,4,1,1,0,4,2,4,3,5,3,4,1,5

%N Number of ways of writing n as a sum of exactly 5 powers of 2.

%C The powers do not need to be distinct.

%H Alois P. Heinz, <a href="/A089050/b089050.txt">Table of n, a(n) for n = 0..65536</a>

%Y A column of A089052. Cf. A036987, A075897, A089048, A089049, A089051, A089053.

%K nonn

%O 0,9

%A _N. J. A. Sloane_, Dec 03 2003

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 07:54 EDT 2024. Contains 371922 sequences. (Running on oeis4.)