|
| |
|
|
A060904
|
|
Exact power of 5 that divides the n-th Fibonacci number (A000045), which is the same as the exact power of 5 that divides n.
|
|
2
| |
|
|
1, 1, 1, 1, 5, 1, 1, 1, 1, 5, 1, 1, 1, 1, 5, 1, 1, 1, 1, 5, 1, 1, 1, 1, 25, 1, 1, 1, 1, 5, 1, 1, 1, 1, 5, 1, 1, 1, 1, 5, 1, 1, 1, 1, 5, 1, 1, 1, 1, 25, 1, 1, 1, 1, 5, 1, 1, 1, 1, 5, 1, 1, 1, 1, 5, 1, 1, 1, 1, 5, 1, 1, 1, 1, 25, 1, 1, 1, 1, 5, 1, 1, 1, 1, 5, 1, 1, 1, 1, 5, 1, 1, 1, 1, 5, 1, 1, 1, 1
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,5
|
|
|
COMMENTS
| Multiplicative with a(p^e) = if p = 5, then 5^e, else 1). - Mitch Harris, Apr 19 2005.
|
|
|
FORMULA
| If n is not divisible by 5 then a(n) = 1, If n = 5^k * m where m is not divisible by 5 then a(n) = 5^k
Multiplicative with a(p^e) = if p = 5, then 5^e, else 1).
|
|
|
EXAMPLE
| a(10) = 5 because the 10-th Fibonacci number is 55 and 55 = 5*11
|
|
|
MAPLE
| A060904 := n -> 5^padic[ordp](n, 5): [Peter Luschny, Nov 26 2010]
|
|
|
CROSSREFS
| Cf. A000045, A060901, A060865.
Sequence in context: A161685 A129398 A109009 * A135469 A170817 A170818
Adjacent sequences: A060901 A060902 A060903 * A060905 A060906 A060907
|
|
|
KEYWORD
| nonn,easy,mult
|
|
|
AUTHOR
| Ahmed Fares (ahmedfares(AT)my-deja.com), May 06 2001
|
|
|
EXTENSIONS
| More terms from Larry Reeves (larryr(AT)acm.org), May 07 2001
|
| |
|
|
