login
This site is supported by donations 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
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, 32, 31, 39, 37, 44, 45, 54, 52, 61, 61, 73, 70, 81, 82, 96, 93, 107, 107, 126, 121, 138, 140, 161, 157, 179, 178, 205, 200, 226, 227, 259, 253, 284, 285, 324, 316, 353, 355, 399, 392, 437 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

LINKS

R. H. Hardin, Table of n, a(n) for n=1..1000

CROSSREFS

Sequence in context: A240864 A241322 A275380 * A161256 A161281 A226916

Adjacent sequences:  A161049 A161050 A161051 * A161053 A161054 A161055

KEYWORD

nonn

AUTHOR

R. H. Hardin Jun 02 2009

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 19 22:55 EDT 2019. Contains 328244 sequences. (Running on oeis4.)