login
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).
2
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,4
LINKS
EXAMPLE
a(12) = 3 because the minimal number of coins needed to make 12 = 2+5+5 is 3.
CROSSREFS
Sequence in context: A345220 A265744 A331083 * A014420 A029289 A181834
KEYWORD
nonn
AUTHOR
Colin Barker, Jul 26 2014
EXTENSIONS
a(0)=0 prepended by Alois P. Heinz, May 26 2015
STATUS
approved