cp's OEIS Frontend

A135939 Highest exponent occurring in the prime factorization of Fibonacci(n).

%I A135939 #15 Sep 09 2024 02:41:10
%S A135939 1,1,1,3,1,1,1,1,1,4,1,1,1,1,1,3,1,1,1,1,1,5,2,1,1,1,1,3,1,1,1,1,1,4,
%T A135939 1,1,1,1,1,3,1,1,1,1,1,6,1,2,1,1,1,3,1,2,1,1,1,4,1,1,1,1,1,3,1,1,1,1,
%U A135939 1,5,1,1,2,1,1,3,1,1,1,1,1,4,1,1,1,1,1,3,2,1,1,1,1,7,1,1,1,2,1,3,1,1,1,1,1
%N A135939 Highest exponent occurring in the prime factorization of Fibonacci(n).
%H A135939 Amiram Eldar, <a href="/A135939/b135939.txt">Table of n, a(n) for n = 3..1422</a>
%F A135939 a(n) = A051903(A000045(n)). - _Amiram Eldar_, Sep 09 2024
%e A135939 a(12) = 4 since Fibonacci(12) = 144 = 2^4 * 3^2.
%p A135939 A051903 := proc(n) if n = 1 then 0 ; else max(seq(op(2,i),i=ifactors(n)[2])) ; fi ; end: A135939 := proc(n) A051903(combinat[fibonacci](n)) ; end: seq(A135939(n),n=3..120) ; # _R. J. Mathar_, Mar 16 2008
%t A135939 f[n_]:=Max[Last/@FactorInteger[n]];Table[f[Fibonacci[n]],{n,3,5!}] (* _Vladimir Joseph Stephan Orlovsky_, Apr 10 2010 *)
%o A135939 (PARI) for(n=3,200,print1(vecmax(factor(fibonacci(n))[,2])",")) \\ Yolinda (yoliahmed33(AT)yandex.ru), Mar 27 2008
%Y A135939 Cf. A000045, A051903.
%K A135939 nonn
%O A135939 3,4
%A A135939 _Colm Mulcahy_, Mar 04 2008
%E A135939 More terms from _R. J. Mathar_ and Yolinda (yoliahmed33(AT)yandex.ru), Mar 16 2008