Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A160232
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A160232
%S A160232 1,2,1,3,2,3,1,4,3,5,2,5,3,4,1,5
%N A160232 s(n)=the number of ways to express n as a sum of integer powers of 2 
               using each power no more than twice.
%H A160232 Mathematical problems<a href="http://projecteuler.net/index.php?section=problems&id=169">
               Problem number 169</a>
%e A160232 4=(1+1+2=2+2=4) thus s(4)=3
%Y A160232 Sequence in context: A071912 A070940 A020651 this_sequence A002487 A060162 
               A026730
%Y A160232 Adjacent sequences: A160229 A160230 A160231 this_sequence A160233 A160234 
               A160235
%K A160232 nonn
%O A160232 1,2
%A A160232 Knut Angstrom (angstrom.knut(AT)telia.com), May 04 2009, May 05 2009

    
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research