|
Search: id:A124918
|
|
|
| A124918 |
|
a(n) = least integer k>=0 such that n=Floor[(5^j)/(3^k)] for some integer j>=0. |
|
+0
2
|
|
| 0, 2, 9, 3, 0, 10, 4, 1, 17, 14, 8, 5, 2, 21, 18, 37, 15, 12, 9, 28, 6, 25, 3, 22, 0, 19, 38, 16, 35, 13, 54, 32, 10, 29, 7, 48, 26, 4, 45, 23, 1, 42, 20, 61, 39, 80, 17, 58, 36, 77, 14, 55, 33, 74, 11, 52, 30, 134, 8, 49, 153, 27, 68, 5, 46, 150, 24, 65, 2, 43, 147, 21, 125, 62
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Every nonnegative integer occurs infinitely many times. The j-sequence is A124910.
|
|
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. A124910.
Sequence in context: A010699 A074916 A091943 this_sequence A011240 A021345 A011066
Adjacent sequences: A124915 A124916 A124917 this_sequence A124919 A124920 A124921
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), Nov 13 2006
|
|
|
Search completed in 0.002 seconds
|
