[seqfan] Re: Minimum quantity of coins

[Eric Angelini]

Many thanks, Giovanni and Harvey!
Best,
É.
[I'd just computed 353 by hand before looking at the mail ;-]

--------

> Harvey 
> 6 and 5, to pay 65 — Min[Total/@FrobeniusSolve[{5,6},65]].

> Giovanni
> Said that, the first terms are
1, 2, 6, 5, 11, 47, 29, 101, 353, 497, 713, 785, 929, 857, 1001, 8705, 2297, 10001, 30665, 38009, 85313, 52697, 100001, 574265, 525737, 1000001, 5731625, 5268377, 10000001, 57415385, 52584617, 100000001, 573261545, 526738457, 1000000001, 5334993353, 5665006649, 9669986705, 5995019945, 10000000001, 63955179497, 46044820505, 100000000001, 514403384537, 585596615465, 928806769073, 656789846393, 1000000000001, 6911108617529, 4088891382473, 10000000000001, 46800022442249, 26399955115505, 100000000000001,...

apparently there is a sort-of pattern with terms of the form 10^k+1.