|
Search: id:A124908
|
|
|
| A124908 |
|
a(n) = least integer j>=0 such that n=Floor[(2^j)/(5^k)] for some integer k>=0. |
|
+0
3
|
|
| 0, 1, 4, 2, 7, 5, 33, 3, 38, 8, 36, 6, 13, 34, 55, 4, 25, 39, 60, 9, 23, 37, 44, 58, 7, 14, 28, 35, 49, 56, 70, 5, 19, 26, 33, 40, 54, 61, 68, 10, 17, 24, 31, 103, 38, 45, 52, 59, 66, 73, 8, 15, 22, 29, 101, 36, 43, 115, 50, 57, 64, 136, 71, 6, 13, 85, 20, 27, 99, 34, 106, 41, 48
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
The k-sequence is A124916.
|
|
EXAMPLE
|
1=[2^0/5^0], 2=[2^1/5^0], 3=[2^4/5^1], 4=[2^2/5^0],...,
so j-sequence=(0,1,4,2,...); k-sequence=(0,0,1,0,...).
|
|
CROSSREFS
|
Cf. A124916.
Sequence in context: A115302 A109857 A002560 this_sequence A143370 A016695 A125271
Adjacent sequences: A124905 A124906 A124907 this_sequence A124909 A124910 A124911
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), Nov 12 2006
|
|
|
Search completed in 0.002 seconds
|
