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

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

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

%S 0,3,4,1,2,14,3,15,4,12,16,5,9,13,21,2,10,14,18,22,3,7,11,15,38,19,23,

%T 4,8,31,12,35,16,39,20,24,5,28,9,32,97,13,36,17,40,21,44,151,25,6,29,

%U 136,10,33,98,14,37,102,18,41,148,22,45,3,26,175,7,72,30,53,11,34,267,15

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

%C The k-sequence is A124917.

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

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

%Y Cf. A124917.

%K nonn

%O 1,2

%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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 14 16:11 EDT 2024. Contains 374322 sequences. (Running on oeis4.)