login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A135939 Highest exponent occuring in the prime factorization of Fibonacci(n). 2
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

Table of n, a(n) for n=3..107.

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: A115069 A046556 A046535 * A061653 A069226 A016565

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified June 22 07:47 EDT 2017. Contains 288605 sequences.