cp's OEIS Frontend

A081952 Smallest Fibonacci number which is one more than the product of n distinct numbers > 1.

%I A081952 #20 Jun 24 2023 04:20:38
%S A081952 3,13,55,1597,17711,1346269,165580141,2971215073,7778742049,
%T A081952 308061521170129,308061521170129,135301852344706746049,
%U A081952 3311648143516982017180081,1983924214061919432247806074196061
%N A081952 Smallest Fibonacci number which is one more than the product of n distinct numbers > 1.
%H A081952 Amiram Eldar, <a href="/A081952/b081952.txt">Table of n, a(n) for n = 1..56</a>
%F A081952 a(n) = A000045(A119249(n)). - _R. J. Mathar_, Feb 06 2010
%e A081952 a(3) = 2*3*9 + 1 = 55;
%e A081952 a(4) = 3*4*7*19 + 1 = 1597;
%e A081952 a(5) = 2*5*7*11*23 + 1 = 17711;
%e A081952 a(6) = 3*4*7*11*31*47 + 1 = 1346269;
%e A081952 a(7) = 3*4*5*11*29*41*211 + 1 = 165580141;
%e A081952 a(8) = 2*3*6*7*8*23*139*461 + 1 = 2971215073.
%t A081952 f[n_, m_, 0] := n == 1; f[n_, m_, d_] := (b = False; l = Select[Divisors[n], #>=m&]; For[i = 1, i <= Length[l], i++, k = l[[i]]; If[f[n / k, k + 1, d - 1], b = True; Break[]]]; b); Do[x = 3; While[ !f[Fibonacci[x] - 1, 2, y], x++ ]; Print[Fibonacci[x]], {y, 1, 50}] (* _Ryan Propper_, Jul 22 2006 *)
%Y A081952 Subset of A000045.
%Y A081952 Cf. A000071, A081953, A119249.
%K A081952 nonn
%O A081952 1,1
%A A081952 _Amarnath Murthy_, Apr 02 2003
%E A081952 More terms from _R. J. Mathar_, Apr 13 2006
%E A081952 More terms from _Ryan Propper_, Jul 22 2006
%E A081952 Edited by _Jon E. Schoenfield_, Nov 18 2018