Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A122840
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A122840 a(n) is the number of 0s at the end of n when n is written in base 10. +0
4
0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0 (list; graph; listen)
OFFSET

1,100

COMMENT

Greatest k such that 10^k divides n.

a(n) = the number of digits in n - A160093(n).

FORMULA

a(n) = A112765(n) * (1 - n mod 2).

a(n) = A160094(n) - 1.

EXAMPLE

a(160) = 1 because there is 1 zero at the end of 160 when 160 is written in base 10.

CROSSREFS

A007814 is the base 2 equivalent of this sequence.

Cf. A160094, A160093, A001511, A070940, A122841.

Sequence in context: A118553 A102448 A102683 this_sequence A083919 A063665 A072507

Adjacent sequences: A122837 A122838 A122839 this_sequence A122841 A122842 A122843

KEYWORD

base,easy,nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Sep 13 2006

page 1

Search completed in 0.002 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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research