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!)
 A124904 a(n) = least integer j>=0 such that n = floor[(3^j)/(2^k)] for some integer k>=0. 2

%I #8 Aug 24 2019 13:48:23

%S 0,2,1,2,4,3,5,7,2,4,6,8,3,10,5,12,7,14,9,4,11,6,18,13,8,32,3,10,22,5,

%T 29,12,36,7,31,14,38,9,33,4,16,40,11,35,6,18,42,13,25,49,8,32,44,15,

%U 27,39,10,22,34,5,17,29,41,12,24,36,48,7,19,31,43,14,26,38,91,9,21,33,86

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

%C The k-sequence is A124912.

%H Rémy Sigrist, <a href="/A124904/b124904.txt">Table of n, a(n) for n = 1..8192</a>

%H Rémy Sigrist, <a href="/A124904/a124904.png">Logarithmic scatterplot of the first 2^13 terms</a>

%H Rémy Sigrist, <a href="/A124904/a124904.gp.txt">PARI program for A124904</a>

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

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

%Y Cf. A124912.

%K nonn

%O 1,2

%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 May 18 03:12 EDT 2024. Contains 372617 sequences. (Running on oeis4.)