

A124919


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


1



0, 1, 3, 7, 0, 2, 4, 34, 6, 43, 15, 1, 38, 17, 3, 47, 33, 19, 5, 56, 42, 28, 14, 7, 0, 51, 37, 30, 16, 9, 2, 60, 46, 39, 32, 25, 18, 11, 4, 62, 55, 48, 41, 34, 27, 20, 13, 6, 71, 64, 57, 50, 115, 43, 36, 29, 94, 22, 15, 80, 8, 1, 66, 59, 124, 52, 45, 110, 38, 103, 31, 24, 89, 17, 82
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,3


COMMENTS

Every nonnegative integer occurs infinitely many times. The jsequence is A124911.


LINKS

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


EXAMPLE

1=[5^0/2^0], 2=[5^1/2^1], 3=[5^2/2^3], 4=[5^4/2^7],...,
so jsequence=(0,1,2,4,...); ksequence=(0,1,3,7,...).


CROSSREFS

Cf. A124911.
Sequence in context: A118746 A181913 A127584 * A033920 A005600 A180873
Adjacent sequences: A124916 A124917 A124918 * A124920 A124921 A124922


KEYWORD

nonn


AUTHOR

Clark Kimberling, Nov 13 2006


STATUS

approved



