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

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

%S 0,0,1,1,1,1,1,1,2,1,1,3,2,2,4,3,3,5,4,4,7,5,5,8,7,7,9,9,8,11,10,10,

%T 14,12,13,16,15,15,19,19,18,23,22,22,27,26,27,31,32,32,36,36,37,43,41,

%U 43,49,48,49,57,56,56,65,64,65,73,72,74,82,82,83,92,92,93,105,102,105,117,115,118

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

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

%K nonn

%O 1,9

%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 August 4 04:52 EDT 2024. Contains 374905 sequences. (Running on oeis4.)