|
%I #8 May 26 2015 11:12:43
%S 0,1,1,2,2,1,2,2,3,3,2,3,3,1,2,2,3,3,2,3,3,4,4,3,4,4,2,3,3,4,4,3,4,4,
%T 1,2,2,3,3,2,3,3,4,4,3,4,4,2,3,3,4,4,3,4,4,5,5,4,5,5,3,4,4,5,5,4,5,5,
%U 2,3,3,4,4,3,4,4,5,5,4,5,5,3,4,4,5,5,4,5,5,1,2,2,3,3,2,3,3,4,4,3,4,4,2,3,3,4
%N The minimal number of coins needed to make change for n units in a currency system with coins of value 1,2,5,13,34,89,...,Fibonacci(2k-1).
%H Alois P. Heinz, <a href="/A245588/b245588.txt">Table of n, a(n) for n = 0..10000</a>
%e a(12) = 3 because the minimal number of coins needed to make 12 = 2+5+5 is 3.
%Y Cf. A000045, A089197.
%K nonn
%O 0,4
%A _Colin Barker_, Jul 26 2014
%E a(0)=0 prepended by _Alois P. Heinz_, May 26 2015
|
