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
 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, 16, 62, 24, 5, 13, 59, 21, 48, 10, 56, 18, 64, 45, 7, 53, 15, 80, 42, 23, 69, 31, 12, 58, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS The k-sequence is A124915. LINKS Table of n, a(n) for n=1..76. EXAMPLE 1=[2^0/3^0], 2=[2^1/3^0], 3=[2^5/3^2], 4=[2^2/3^0],..., so j-sequence=(0,1,5,2,...); k-sequence=(0,0,2,0,...). CROSSREFS Cf. A124915. Sequence in context: A063567 A072223 A246312 * A181050 A020800 A248261 Adjacent sequences: A124904 A124905 A124906 * A124908 A124909 A124910 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.

Last modified May 21 16:37 EDT 2024. Contains 372738 sequences. (Running on oeis4.)