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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A124915 a(n) = least integer k>=0 such that n=Floor[(2^j)/(3^k)] for some integer j>=0. 1
 0, 0, 2, 0, 1, 4, 2, 0, 3, 1, 6, 4, 9, 2, 12, 0, 10, 3, 8, 25, 1, 6, 11, 16, 4, 9, 26, 2, 7, 36, 12, 0, 5, 34, 10, 27, 3, 32, 8, 37, 25, 1, 30, 6, 47, 23, 11, 40, 16, 4, 33, 21, 9, 38, 26, 2, 43, 31, 7, 48, 36, 24, 12, 0, 29, 17, 5, 46, 34, 22, 10, 39, 27, 15, 3, 44, 32, 20, 8, 49 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Every nonnegative integer occurs infinitely many times. The j-sequence is A124907. LINKS Table of n, a(n) for n=1..80. 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. A124907. Sequence in context: A289522 A361397 A316273 * A322084 A158239 A159819 Adjacent sequences: A124912 A124913 A124914 * A124916 A124917 A124918 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 June 23 18:37 EDT 2024. Contains 373653 sequences. (Running on oeis4.)