|
| |
|
|
A135939
|
|
Highest exponent occuring in the prime factorization of Fib(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; internal format)
|
|
|
|
OFFSET
| 3,4
|
|
|
EXAMPLE
| 10th term is 4 since 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 (mathar(AT)strw.leidenuniv.nl), Mar 16 2008
|
|
|
MATHEMATICA
| f[n_]:=Max[Last/@FactorInteger[n]]; Table[f[Fibonacci[n]], {n, 3, 5!}] [From Vladimir Orlovsky (4vladimir(AT)gmail.com), 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 (colm(AT)spelman.edu), Mar 04 2008
|
|
|
EXTENSIONS
| More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl) and Yolinda (yoliahmed33(AT)yandex.ru), Mar 16 2008
|
| |
|
|
