|
Search: id:A124911
|
|
|
| A124911 |
|
a(n) = least integer j>=0 such that n=Floor[(5^j)/(2^k)] for some integer k>=0. |
|
+0
2
|
|
| 0, 1, 2, 4, 1, 2, 3, 16, 4, 20, 8, 2, 18, 9, 3, 22, 16, 10, 4, 26, 20, 14, 8, 5, 2, 24, 18, 15, 9, 6, 3, 28, 22, 19, 16, 13, 10, 7, 4, 29, 26, 23, 20, 17, 14, 11, 8, 5, 33, 30, 27, 24, 52, 21, 18, 15, 43, 12, 9, 37, 6, 3, 31, 28, 56, 25, 22, 50, 19, 47, 16, 13, 41, 10, 38, 7, 35, 4, 60
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
The k-sequence is A124919.
|
|
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. A124919.
Sequence in context: A087419 A050979 A053450 this_sequence A132954 A069705 A106645
Adjacent sequences: A124908 A124909 A124910 this_sequence A124912 A124913 A124914
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), Nov 13 2006
|
|
|
Search completed in 0.002 seconds
|
