Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A089051
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A089051
%S A089051 0,0,0,0,0,0,1,1,1,2,2,2,3,3,3,3,4,3,4,3,4,4,5,4,6,4,5,4,6,4,6,4,5,3,5,
%T A089051 3,6,5,6,4,7,5,7,5,8,5,7,4,7,4,6,4,8,5,7,4,7,4,7,4,7,4,5,1,5,3,5,3,7,5,
%U A089051 6,4,9,6,8,5,9,5,7,4,8,5,8,5,10,6,8,4,9,5,8,4,8,4,5,1,7,4,6,4,9,5,7,4,
               9
%N A089051 Number of ways of writing n as a sum of exactly 6 powers of 2.
%C A089051 The powers do not need to be distinct.
%Y A089051 A column of A089052. Cf. A036987, A075897, A089048, A089049, A089050, 
               A089053.
%Y A089051 Sequence in context: A069923 A095840 A131343 this_sequence A108229 A023966 
               A088141
%Y A089051 Adjacent sequences: A089048 A089049 A089050 this_sequence A089052 A089053 
               A089054
%K A089051 nonn
%O A089051 0,10
%A A089051 N. J. A. Sloane (njas(AT)research.att.com), Dec 03 2003

    
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 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research