This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A139044 #30 Feb 17 2023 01:59:22 %S A139044 2,3,5,2,13,3,2,5,89,2,233,13,2,3,1597,2,37,3,2,89,28657,2,5,233,2,3, %T A139044 514229,2,557,3,2,1597,5,2,73,37,2,3,2789,2,433494437,3,2,139, %U A139044 2971215073,2,13,5,2,3,953,2,5,3,2,59,353,2,4513,557,2,3,5,2,269,3,2,5,6673,2 %N A139044 Smallest prime divisor of the Fibonacci numbers > 1. %C A139044 Fibonacci number > 1, divided by its largest proper divisor. %H A139044 Tyler Busby, <a href="/A139044/b139044.txt">Table of n, a(n) for n = 1..1450</a> (terms 1..200 Vincenzo Librandi, terms 201..1406 from Amiram Eldar) %F A139044 a(n) = A000045(n+2)/A032742(A000045(n+2)) = A000045(n+2)/A139045(n). %F A139044 a(n) = A020639(A000045(n+2)). - _Michel Marcus_, Nov 15 2014 %F A139044 a(n) = A060383(n+2). - _Alois P. Heinz_, Oct 11 2015 %p A139044 with(numtheory): with(combinat): a:=proc(n) options operator, arrow: op(2, divisors(fibonacci(n))) end proc: seq(a(n),n=3..60); # _Emeric Deutsch_, May 02 2008 %t A139044 First[First[FactorInteger[ # ]]]&/@Fibonacci[Range[3,40]] (* _Harvey P. Dale_, Apr 30 2008 *) %o A139044 (PARI) a(n) = factor(fibonacci(n+2))[1,1]; \\ _Michel Marcus_, Nov 15 2014 %o A139044 (Magma) [Minimum(PrimeDivisors(Fibonacci(n+2))): n in [1..70]]; // _Vincenzo Librandi_, Dec 24 2016 %Y A139044 Cf. A000045, A032742, A060383, A133021, A139045. %K A139044 nonn %O A139044 1,1 %A A139044 _Omar E. Pol_, Apr 23 2008 %E A139044 More terms from _Emeric Deutsch_ and _Harvey P. Dale_, May 02 2008 %E A139044 More terms from _Vincenzo Librandi_, Dec 24 2016