A124916 a(n) = least integer k>=0 such that n=Floor[(2^j)/(5^k)] for some integer j>=0.

0, 0, 1, 0, 2, 1, 13, 0, 15, 2, 14, 1, 4, 13, 22, 0, 9, 15, 24, 2, 8, 14, 17, 23, 1, 4, 10, 13, 19, 22, 28, 0, 6, 9, 12, 15, 21, 24, 27, 2, 5, 8, 11, 42, 14, 17, 20, 23, 26, 29, 1, 4, 7, 10, 41, 13, 16, 47, 19, 22, 25, 56, 28, 0, 3, 34, 6, 9, 40, 12, 43, 15, 18, 49, 21, 52, 24, 55, 27, 58

Offset

1,5

Comments

Every nonnegative integer occurs infinitely many times. The j-sequence is A124908.

Links

Table of n, a(n) for n=1..80.

Example

1=[2^0/5^0], 2=[2^1/5^0], 3=[2^4/5^1], 4=[2^2/5^0],...,
so j-sequence=(0,1,4,2,...); k-sequence=(0,0,1,0,...).

Crossrefs

Cf. A124908.

Sequence in context: A171510 A106750 A258821 * A007418 A037271 A074955

Adjacent sequences: A124913 A124914 A124915 * A124917 A124918 A124919

Keyword

nonn

Author

Clark Kimberling, Nov 12 2006

Status

approved