login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A124916 a(n) = least integer k>=0 such that n=Floor[(2^j)/(5^k)] for some integer j>=0. 1
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
COMMENTS
Every nonnegative integer occurs infinitely many times. The j-sequence is A124908.
LINKS
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
KEYWORD
nonn
AUTHOR
Clark Kimberling, Nov 12 2006
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 17 04:55 EDT 2024. Contains 374360 sequences. (Running on oeis4.)