login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A124911 a(n) = least integer j>=0 such that n=Floor[(5^j)/(2^k)] for some integer k>=0. 1

%I

%S 0,1,2,4,1,2,3,16,4,20,8,2,18,9,3,22,16,10,4,26,20,14,8,5,2,24,18,15,

%T 9,6,3,28,22,19,16,13,10,7,4,29,26,23,20,17,14,11,8,5,33,30,27,24,52,

%U 21,18,15,43,12,9,37,6,3,31,28,56,25,22,50,19,47,16,13,41,10,38,7,35,4,60

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

%C The k-sequence is A124919.

%e 1=[5^0/2^0], 2=[5^1/2^1], 3=[5^2/2^3], 4=[5^4/2^7],...,

%e so j-sequence=(0,1,2,4,...); k-sequence=(0,1,3,7,...).

%Y Cf. A124919.

%K nonn

%O 1,3

%A _Clark Kimberling_, Nov 13 2006

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 14 17:44 EDT 2021. Contains 343900 sequences. (Running on oeis4.)