Optimal denominations for coins and currency

Let all denominations have the same cost. Let transactions be any amount between 1 and (3k+1 − 1)/2. Since one can make change, the least expensive set of weights requires denominations that are powers of 3 from 1 to k.