login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

F(P(n)) where P(n) is the unrestricted partition number of n and F(n) is the Fibonacci number.
1

%I #18 Sep 08 2022 08:45:15

%S 1,1,2,5,13,89,610,17711,832040,267914296,225851433717,

%T 5527939700884757,573147844013817084101,7308805952221443105020355490,

%U 2706074082469569338358691163510069157,844617150046923109759866426342507997914076076194

%N F(P(n)) where P(n) is the unrestricted partition number of n and F(n) is the Fibonacci number.

%H Seiichi Manyama, <a href="/A100843/b100843.txt">Table of n, a(n) for n = 1..29</a>

%F a(n) = A000045(A000041(n)). - _Michel Marcus_, Aug 27 2015

%e a(4) = F(P(4)) = F(5) = 5.

%e a(8) = F(P(8)) = F(22) = 17711.

%t Table[Fibonacci[PartitionsP[n]], {n, 1, 20}] (* _Stefan Steinerberger_, Feb 28 2006 *)

%o (Magma) [Fibonacci(NumberOfPartitions(n)): n in [1..20]]; // _Vincenzo Librandi_, Aug 27 2015

%K nonn

%O 1,3

%A _Parthasarathy Nambi_, Jan 07 2005

%E More terms from _Stefan Steinerberger_, Feb 28 2006