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!)
 A060901 Exact power of 3 that divides the n-th Fibonacci number (sequence A000045). 2
 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 9, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 9, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 27, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 9, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 9, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 27, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 9, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..1000 FORMULA If n is not divisible by 4 then a(n) = 1, if n = 4 * 3^k * m where m is not divisible by 3 then a(n) = 3^(k+1). a(n) = A038500(A000045(n)). - Michel Marcus, Jul 30 2013 EXAMPLE a(12) = 9 because the 12th Fibonacci number is 144 and 144 = 9*16. PROG (PARI) a(n) = 3^valuation(fibonacci(n), 3) \\Michel Marcus, Jul 30 2013 (Haskell) a060901 = a038500 . a000045  -- Reinhard Zumkeller, Feb 04 2015 CROSSREFS Cf. A000045, A060865. Cf. A038500. Sequence in context: A069292 A091842 A306346 * A087612 A260626 A155828 Adjacent sequences:  A060898 A060899 A060900 * A060902 A060903 A060904 KEYWORD nonn,easy AUTHOR Ahmed Fares (ahmedfares(AT)my-deja.com), May 05 2001 EXTENSIONS More terms from Larry Reeves (larryr(AT)acm.org), May 07 2001 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 15:37 EST 2020. Contains 331049 sequences. (Running on oeis4.)