|
Search: id:A124919
|
|
|
| A124919 |
|
a(n) = least integer k>=0 such that n=Floor[(5^j)/(2^k)] for some integer j>=0. |
|
+0
2
|
|
| 0, 1, 3, 7, 0, 2, 4, 34, 6, 43, 15, 1, 38, 17, 3, 47, 33, 19, 5, 56, 42, 28, 14, 7, 0, 51, 37, 30, 16, 9, 2, 60, 46, 39, 32, 25, 18, 11, 4, 62, 55, 48, 41, 34, 27, 20, 13, 6, 71, 64, 57, 50, 115, 43, 36, 29, 94, 22, 15, 80, 8, 1, 66, 59, 124, 52, 45, 110, 38, 103, 31, 24, 89, 17, 82
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Every nonnegative integer occurs infinitely many times. The j-sequence is A124911.
|
|
EXAMPLE
|
1=[5^0/2^0], 2=[5^1/2^1], 3=[5^2/2^3], 4=[5^4/2^7],...,
so j-sequence=(0,1,2,4,...); k-sequence=(0,1,3,7,...).
|
|
CROSSREFS
|
Cf. A124911.
Adjacent sequences: A124916 A124917 A124918 this_sequence A124920 A124921 A124922
Sequence in context: A016617 A118746 A127584 this_sequence A033920 A005600 A021031
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), Nov 13 2006
|
|
|
Search completed in 0.002 seconds
|
