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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A124917 a(n) = least integer k>=0 such that n=Floor[(4^j)/(3^k)] for some integer j>=0. 1
0, 3, 4, 0, 1, 16, 2, 17, 3, 13, 18, 4, 9, 14, 24, 0, 10, 15, 20, 25, 1, 6, 11, 16, 45, 21, 26, 2, 7, 36, 12, 41, 17, 46, 22, 27, 3, 32, 8, 37, 119, 13, 42, 18, 47, 23, 52, 187, 28, 4, 33, 168, 9, 38, 120, 14, 43, 125, 19, 48, 183, 24, 53, 0, 29, 217, 5, 87, 34, 63, 10, 39, 333, 15 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Every nonnegative integer occurs infinitely many times. The j-sequence is A124909.
LINKS
EXAMPLE
1=[4^0/3^0], 2=[4^3/3^3], 3=[4^4/3^4], 4=[4^1/3^0],...,
so j-sequence=(0,3,4,1,...); k-sequence=(0,3,4,0,...).
CROSSREFS
Cf. A124908.
Sequence in context: A324362 A073234 A123685 * A228550 A354520 A189916
KEYWORD
nonn
AUTHOR
Clark Kimberling, Nov 13 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 14 12:31 EDT 2024. Contains 374318 sequences. (Running on oeis4.)