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!)
 A124912 a(n) = least integer k>=0 such that n=Floor[(3^j)/(2^k)] for some integer j>=0. 1
 0, 2, 0, 1, 4, 2, 5, 8, 0, 3, 6, 9, 1, 12, 4, 15, 7, 18, 10, 2, 13, 5, 24, 16, 8, 46, 0, 11, 30, 3, 41, 14, 52, 6, 44, 17, 55, 9, 47, 1, 20, 58, 12, 50, 4, 23, 61, 15, 34, 72, 7, 45, 64, 18, 37, 56, 10, 29, 48, 2, 21, 40, 59, 13, 32, 51, 70, 5, 24, 43, 62, 16, 35, 54, 138, 8, 27, 46, 130 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Every nonnegative integer occurs infinitely many times. The j-sequence is A124904. LINKS Table of n, a(n) for n=1..79. EXAMPLE 1=[3^0/2^0], 2=[3^2/2^2], 3=[3^1/2^0], 4=[3^2/2^1],..., so j-sequence = (0,2,1,2,...); k-sequence = (0,2,0,1,...). CROSSREFS Cf. A124904. Sequence in context: A030188 A176703 A160648 * A138752 A357499 A368506 Adjacent sequences: A124909 A124910 A124911 * A124913 A124914 A124915 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 23 10:34 EDT 2024. Contains 372760 sequences. (Running on oeis4.)