|
%I #35 Jan 04 2024 18:58:11
%S 2,2,3,7,31,241,3121,65521,2227681,122522401,10904493601,
%T 1570247078401,365867569267201,137932073613734401,
%U 84138564904377984001,83044763560621070208001,132622487406311849122176001,342696507457909818131702784001
%N a(n) = 1 + Product_{k=1..n} Fibonacci(k).
%C The first 8 terms are primes. - _Jonathan Vos Post_, Dec 08 2012
%C a(22) and a(28) are also primes. - _Robert Israel_, Jun 10 2015
%C There are no further primes up to a(300). - _Harvey P. Dale_, Feb 28 2023
%H Robert Israel, <a href="/A052449/b052449.txt">Table of n, a(n) for n = 1..93</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/FibonacciNumber.html">Fibonacci Number</a>.
%F a(n) = A003266(n)+1. - _Robert Israel_, Jun 10 2015
%p seq(1+mul(combinat:-fibonacci(j),j=1..n), n=1..30); # _Robert Israel_, Jun 10 2015
%t 1 + Table[Times @@ Fibonacci[Range[n]], {n, 20}] (* _T. D. Noe_, Dec 29 2012 *)
%t FoldList[Times,Fibonacci[Range[20]]]+1 (* _Harvey P. Dale_, Feb 28 2023 *)
%o (PARI) vector(20, n, 1+prod(j=1,n, fibonacci(j))) \\ _G. C. Greubel_, Sep 26 2019
%o (Magma) [1+(&*[Fibonacci(j): j in [1..n]]): n in [1..20]]; // _G. C. Greubel_, Sep 26 2019
%o (Sage) [1+product(fibonacci(j) for j in (1..n)) for n in (1..20)] # _G. C. Greubel_, Sep 26 2019
%o (GAP) List([1..20], n-> 1+Product([1..n], j-> Fibonacci(j)) ); # _G. C. Greubel_, Sep 26 2019
%Y Cf. A000045, A003266, A053413, A053408.
%K nonn
%O 1,1
%A _Eric W. Weisstein_
| 