A112765 - OEIS

This site is supported by donations to The OEIS Foundation.

A112765

Exponent of highest power of 5 dividing n.

0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 2, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 2, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 2, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 2, 0, 0, 0, 0, 1 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,25`
	COMMENTS	`A027868 gives partial sums.`
	LINKS	`Reinhard Zumkeller, Table of n, a(n) for n = 1..10000`
	FORMULA	`Totally additive with a(p) = 1 if p = 5, 0 otherwise.`
	PROG	`(Haskell)` `a112765 n = fives n 0 where` `fives n e \| r > 0 = e` `\| otherwise = fives n' (e + 1) where (n', r) = divMod n 5` `-- Reinhard Zumkeller, Apr 08 2011` `(Pari) A112765(n)=valuation(n, 5); /* Joerg Arndt, Apr 08 2011 */`
	CROSSREFS	`Cf. A007814, A007949, A112762, A022337.` `Cf. A122840.` `Sequence in context: A178408 A073345 A138088 * A105966 A083915 A083892` `Adjacent sequences: A112762 A112763 A112764 * A112766 A112767 A112768`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Sep 18 2005`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 17:13 EST 2012. Contains 205828 sequences.