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!)
A161032 Number of partitions of n into Fibonacci numbers where every part appears at least 8 times 1

%I #4 Mar 31 2012 12:35:28

%S 0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,2,1,2,1,2,1,2,1,4,2,4,4,5,4,7,5,8,8,9,

%T 9,12,10,13,13,16,14,18,16,19,20,21,20,26,24,29,29,32,33,39,39,44,45,

%U 51,51,60,59,65,69,77,78,87,88,97,102,111,113,127,130,140,148,157,162,177,182,199,204,218

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

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

%K nonn

%O 1,16

%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 18 18:49 EDT 2024. Contains 371781 sequences. (Running on oeis4.)