login
This site is supported by donations 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
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, 14, 12, 13, 16, 15, 15, 19, 19, 18, 23, 22, 22, 27, 26, 27, 31, 32, 32, 36, 36, 37, 43, 41, 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 (list; graph; refs; listen; history; internal format)
OFFSET

1,9

LINKS

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

CROSSREFS

Sequence in context: A029308 A029259 A159266 * A161104 A110248 A094340

Adjacent sequences:  A161062 A161063 A161064 * A161066 A161067 A161068

KEYWORD

nonn

AUTHOR

R. H. Hardin (rhhardin(AT)att.net) Jun 02 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 21:13 EST 2012. Contains 206085 sequences.