login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A124913 a(n) = least integer k>=0 such that n=Floor[(3^j)/(4^k)] for some integer j>=0. 1
0, 1, 0, 6, 2, 1, 12, 4, 0, 7, 3, 14, 10, 6, 2, 17, 13, 9, 5, 1, 16, 35, 12, 8, 4, 23, 0, 38, 15, 11, 30, 7, 26, 3, 22, 18, 60, 14, 56, 33, 10, 29, 6, 25, 2, 21, 105, 40, 17, 36, 13, 55, 32, 9, 135, 28, 5, 131, 24, 1, 85, 20, 230, 39, 16, 100, 35, 203, 12, 222, 31, 8, 50, 27, 69, 4, 46 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

Each nonnegative integer occurs infinitely many times. The j-sequence is A124905.

LINKS

Table of n, a(n) for n=1..77.

EXAMPLE

1=[3^0/4^0], 2=[3^2/4^1], 3=[3^1/4^0], 4=[3^9/4^6],...,

so j-sequence=(0,2,1,9,...); k-sequence=(0,1,0,6,...).

CROSSREFS

Cf. A124905.

Sequence in context: A217909 A334943 A002247 * A181415 A289711 A101818

Adjacent sequences:  A124910 A124911 A124912 * A124914 A124915 A124916

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 17 18:27 EDT 2021. Contains 343986 sequences. (Running on oeis4.)