Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135939
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A135939
%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,1,
%T A135939 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,
%U A135939 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 occuring in the prime factorization of Fib(n).
%e A135939 10th term is 4 since 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 (mathar(AT)strw.leidenuniv.nl), 
               Mar 16 2008
%o A135939 (PARI) for(n=3,200,print1(vecmax(factor(fibonacci(n))[,2])",")) - Yolinda 
               (yoliahmed33(AT)yandex.ru), Mar 27 2008
%Y A135939 Sequence in context: A115069 A046556 A046535 this_sequence A061653 A069226 
               A016565
%Y A135939 Adjacent sequences: A135936 A135937 A135938 this_sequence A135940 A135941 
               A135942
%K A135939 nonn
%O A135939 3,4
%A A135939 Colm Mulcahy (colm(AT)spelman.edu), Mar 04 2008
%E A135939 More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl) and Yolinda 
               (yoliahmed33(AT)yandex.ru), Mar 16 2008

    
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research