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!)
A161052 Number of partitions of n into powers of two where every part appears at least 3 times 1

%I #4 Mar 31 2012 12:35:29

%S 0,0,1,1,1,2,1,2,2,3,3,5,4,5,6,8,7,9,9,12,11,14,14,19,17,21,22,27,26,

%T 32,31,39,37,44,45,54,52,61,61,73,70,81,82,96,93,107,107,126,121,138,

%U 140,161,157,179,178,205,200,226,227,259,253,284,285,324,316,353,355,399,392,437

%N Number of partitions of n into powers of two where every part appears at least 3 times

%H R. H. Hardin, <a href="/A161052/b161052.txt">Table of n, a(n) for n=1..1000</a>

%K nonn

%O 1,6

%A _R. H. Hardin_ Jun 02 2009

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 18:17 EDT 2024. Contains 371962 sequences. (Running on oeis4.)