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!)
A124910 a(n) = least integer j>=0 such that n=Floor[(5^j)/(3^k)] for some integer k>=0. 1
0, 2, 7, 3, 1, 8, 4, 2, 13, 11, 7, 5, 3, 16, 14, 27, 12, 10, 8, 21, 6, 19, 4, 17, 2, 15, 28, 13, 26, 11, 39, 24, 9, 22, 7, 35, 20, 5, 33, 18, 3, 31, 16, 44, 29, 57, 14, 42, 27, 55, 12, 40, 25, 53, 10, 38, 23, 94, 8, 36, 107, 21, 49, 6, 34, 105, 19, 47, 4, 32, 103, 17, 88, 45, 116, 30 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

The k-sequence is A124918.

LINKS

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

EXAMPLE

1=[5^0/3^0], 2=[5^2/3^2], 3=[5^7/3^9], 4=[5^3/3^3],..., so j-sequence=(0,2,7,3,...); k-sequence=(0,2,9,3,...).

CROSSREFS

Cf. A124918.

Sequence in context: A200439 A197281 A019703 * A303954 A090388 A021370

Adjacent sequences:  A124907 A124908 A124909 * A124911 A124912 A124913

KEYWORD

nonn

AUTHOR

Clark Kimberling, Nov 13 2006, corrected 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 11 21:35 EDT 2021. Contains 343808 sequences. (Running on oeis4.)