login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161035 Number of partitions of n into Fibonacci numbers where every part appears at least 11 times. 1

%I #6 May 09 2022 00:55:23

%S 0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,2,1,2,1,2,1,2,1,2,1,2,3,3,

%T 3,5,4,5,6,6,6,8,7,9,10,10,11,13,12,14,15,15,16,18,19,19,21,21,22,25,

%U 24,25,27,27,29,32,32,34,37,39,41,45,46,49,54,56,60,64,67,71,77,80,84,90,94,99,106,112,116,124

%N Number of partitions of n into Fibonacci numbers where every part appears at least 11 times.

%H R. H. Hardin, <a href="/A161035/b161035.txt">Table of n, a(n) for n=1..1000</a>

%K nonn

%O 1,22

%A _R. H. Hardin_, Jun 02 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 09:23 EDT 2024. Contains 371782 sequences. (Running on oeis4.)