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!)
A124906 a(n) = least integer j>=0 such that n=Floor[(3^j)/(5^k)] for some integer k>=0. 1
0, 8, 1, 13, 3, 9, 15, 21, 2, 8, 11, 14, 17, 20, 23, 4, 7, 10, 32, 13, 57, 16, 19, 41, 22, 44, 3, 47, 6, 50, 9, 31, 53, 12, 56, 15, 37, 59, 18, 40, 62, 21, 84, 43, 65, 24, 46, 5, 27, 90, 49, 8, 30, 93, 52, 11, 74, 33, 55, 118, 14, 36, 99, 58, 121, 17, 39, 102, 61, 124, 20, 146, 42 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

The k-sequence is A124914.

LINKS

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

EXAMPLE

1=[3^0/5^0], 2=[3^8/5^5], 3=[3^1/5^0], 4=[3^13/5^8],...,

so j-sequence=(0,8,1,13,...); k-sequence=(0,5,0,8,...).

CROSSREFS

Cf. A124914.

Sequence in context: A045771 A070488 A322079 * A298143 A181762 A209684

Adjacent sequences:  A124903 A124904 A124905 * A124907 A124908 A124909

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 June 20 13:10 EDT 2021. Contains 345164 sequences. (Running on oeis4.)