The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A135939 Highest exponent occurring in the prime factorization of Fibonacci(n). 3
 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, 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, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 3,4 LINKS EXAMPLE a(12) = 4 since Fibonacci(12) = 144 = 2^4 * 3^2. MAPLE 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 MATHEMATICA f[n_]:=Max[Last/@FactorInteger[n]]; Table[f[Fibonacci[n]], {n, 3, 5!}] (* Vladimir Joseph Stephan Orlovsky, Apr 10 2010 *) PROG (PARI) for(n=3, 200, print1(vecmax(factor(fibonacci(n))[, 2])", ")) \\ Yolinda (yoliahmed33(AT)yandex.ru), Mar 27 2008 CROSSREFS Sequence in context: A046556 A046535 A324198 * A061653 A069226 A326697 Adjacent sequences:  A135936 A135937 A135938 * A135940 A135941 A135942 KEYWORD nonn AUTHOR Colm Mulcahy, Mar 04 2008 EXTENSIONS More terms from R. J. Mathar and Yolinda (yoliahmed33(AT)yandex.ru), Mar 16 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 19 18:25 EST 2021. Contains 340270 sequences. (Running on oeis4.)