The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

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

%I #2 Mar 30 2012 18:57:06

%S 0,1,5,2,4,9,6,3,8,5,13,10,18,7,23,4,20,9,17,44,6,14,22,30,11,19,46,8,

%T 16,62,24,5,13,59,21,48,10,56,18,64,45,7,53,15,80,42,23,69,31,12,58,

%U 39,20,66,47,9,74,55,17,82,63,44,25,6,52,33,14,79,60,41,22,68,49,30,11,76

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

%C The k-sequence is A124915.

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

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

%Y Cf. A124915.

%K nonn

%O 1,3

%A _Clark Kimberling_, Nov 12 2006

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.

Last modified June 18 18:01 EDT 2024. Contains 373486 sequences. (Running on oeis4.)