A245574 - OEIS

%I #11 May 26 2015 10:44:11

%S 0,1,1,2,2,1,2,2,3,3,1,2,2,3,3,2,3,3,4,4,1,2,2,3,3,2,3,3,4,4,2,3,3,4,

%T 4,3,4,4,5,5,2,3,3,4,4,3,4,4,5,5,1,2,2,3,3,2,3,3,4,4,2,3,3,4,4,3,4,4,

%U 5,5,2,3,3,4,4,3,4,4,5,5,3,4,4,5,5,4,5,5,6,6,3,4,4,5,5,4,5,5,6,6,2

%N Minimal coin changing sequence for denominations 1, 2, 5, 10, 20 and 50 cents.

%C a(100) = 2 is the first term where the sequence is different from A057536. - _Colin Barker_, Jul 26 2014

%H <a href="http://math.stackexchange.com/questions/260404/finding-recurrence-and-an-algorithm-to-represent-it">Coin change problem</a>

%Y Cf. A001299, A011542, A057536.

%K nonn

%O 0,4

%A _Marko Riedel_, Jul 25 2014

%E More terms from _Colin Barker_, Jul 26 2014

%E a(0)=0 prepended by _Alois P. Heinz_, May 26 2015