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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161036 Number of partitions of n into Fibonacci numbers where every part appears at least 12 times 1
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 4, 2, 4, 4, 5, 4, 7, 5, 7, 7, 8, 7, 11, 9, 11, 12, 13, 12, 16, 14, 16, 17, 18, 17, 23, 19, 22, 23, 24, 24, 28, 25, 28, 29, 31, 29, 36, 33, 37, 40, 41, 42, 49, 47, 53, 55, 59, 60, 69, 68, 74, 78, 83, 85, 95, 94, 102, 107 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,24

LINKS

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

CROSSREFS

Sequence in context: A185218 A161317 A161251 * A161087 A161303 A161278

Adjacent sequences:  A161033 A161034 A161035 * A161037 A161038 A161039

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 August 5 01:47 EDT 2021. Contains 346456 sequences. (Running on oeis4.)