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!)
A161037 Number of partitions of n into Fibonacci numbers where every part appears at least 13 times 1
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 3, 3, 3, 5, 4, 5, 6, 6, 6, 8, 7, 8, 9, 10, 10, 12, 12, 13, 14, 15, 15, 17, 17, 18, 19, 20, 22, 22, 23, 24, 25, 27, 27, 28, 29, 30, 32, 32, 33, 36, 37, 40, 41, 43, 46, 49, 52, 54, 57, 61, 64, 69, 72, 75, 81, 84, 90, 94 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,26

LINKS

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

CROSSREFS

Sequence in context: A175834 A161318 A161252 * A161088 A161304 A161279

Adjacent sequences:  A161034 A161035 A161036 * A161038 A161039 A161040

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 4 11:58 EDT 2021. Contains 346447 sequences. (Running on oeis4.)