login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161033 Number of partitions of n into Fibonacci numbers where every part appears at least 9 times 1
0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 3, 3, 3, 5, 4, 5, 6, 6, 6, 9, 8, 9, 11, 11, 11, 14, 13, 14, 18, 16, 17, 20, 19, 21, 23, 22, 23, 28, 28, 29, 33, 33, 36, 42, 41, 44, 50, 51, 56, 60, 62, 66, 73, 76, 79, 89, 90, 96, 106, 107, 115, 124, 128, 138, 147, 153, 161, 173, 180 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,18

LINKS

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

CROSSREFS

Sequence in context: A245040 A161314 A161248 * A161084 A161300 A161275

Adjacent sequences:  A161030 A161031 A161032 * A161034 A161035 A161036

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 November 22 16:31 EST 2019. Contains 329396 sequences. (Running on oeis4.)