login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161031 Number of partitions of n into Fibonacci numbers where every part appears at least 7 times 1
0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 3, 3, 3, 5, 4, 5, 6, 7, 7, 9, 9, 10, 11, 12, 14, 14, 15, 16, 17, 19, 19, 22, 23, 25, 28, 29, 32, 35, 38, 41, 44, 47, 51, 55, 59, 65, 68, 73, 79, 84, 90, 96, 104, 112, 118, 126, 133, 142, 151, 161, 170, 182, 190, 202, 212, 224, 237, 251, 264 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,14

LINKS

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

CROSSREFS

Sequence in context: A245038 A161312 A161246 * A161082 A161298 A161273

Adjacent sequences:  A161028 A161029 A161030 * A161032 A161033 A161034

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 December 6 01:25 EST 2021. Contains 349558 sequences. (Running on oeis4.)