A124914 - OEIS

A124914

a(n) = least integer k>=0 such that n=Floor[(3^j)/(5^k)] for some integer j>=0.

0, 5, 0, 8, 1, 5, 9, 13, 0, 4, 6, 8, 10, 12, 14, 1, 3, 5, 20, 7, 37, 9, 11, 26, 13, 28, 0, 30, 2, 32, 4, 19, 34, 6, 36, 8, 23, 38, 10, 25, 40, 12, 55, 27, 42, 14, 29, 1, 16, 59, 31, 3, 18, 61, 33, 5, 48, 20, 35, 78, 7, 22, 65, 37, 80, 9, 24, 67, 39, 82, 11, 97, 26, 112, 41, 84, 13, 99

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

Every nonnegative integers occurs infinitely many times. The j-sequence is A124906.

LINKS

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

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. A124906.