A245588 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).

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, 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, 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

Offset: 0

Author

Colin Barker, Jul 26 2014

Keywords

• nonn

Examples

			a(12) = 3 because the minimal number of coins needed to make 12 = 2+5+5 is 3.
		

Links

• Alois P. Heinz, Table of n, a(n) for n = 0..10000

Crossrefs

Cf. A000045, A089197.

Extensions

a(0)=0 prepended by Alois P. Heinz, May 26 2015