This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A074724 Largest power of 3 dividing F(4n) where F(k) is the k-th Fibonacci number. 0
 3, 3, 9, 3, 3, 9, 3, 3, 27, 3, 3, 9, 3, 3, 9, 3, 3, 27, 3, 3, 9, 3, 3, 9, 3, 3, 81, 3, 3, 9, 3, 3, 9, 3, 3, 27, 3, 3, 9, 3, 3, 9, 3, 3, 27, 3, 3, 9, 3, 3, 9, 3, 3, 81, 3, 3, 9, 3, 3, 9, 3, 3, 27, 3, 3, 9, 3, 3, 9, 3, 3, 27, 3, 3, 9, 3, 3, 9, 3, 3, 243, 3, 3, 9, 3, 3, 9, 3, 3, 27, 3, 3, 9, 3, 3, 9, 3, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS if m=1, 2 or 3 (mod 4) F(m) is not divisible by 3. LINKS FORMULA If k =1 or 2 (mod 3) a(3^m*k) = 3^(m+1) for m>=0 MATHEMATICA Table[3^IntegerExponent[Fibonacci[4n], 3], {n, 100}] (* Harvey P. Dale, Jun 03 2012 *) CROSSREFS Sequence in context: A144809 A225074 A127795 * A109932 A071909 A134662 Adjacent sequences:  A074721 A074722 A074723 * A074725 A074726 A074727 KEYWORD nonn AUTHOR Benoit Cloitre, Sep 04 2002 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 October 17 22:16 EDT 2019. Contains 328134 sequences. (Running on oeis4.)