login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

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

EXAMPLE

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

CROSSREFS

Cf. A000045, A089197.

Sequence in context: A345220 A265744 A331083 * A014420 A029289 A181834

Adjacent sequences:  A245585 A245586 A245587 * A245589 A245590 A245591

KEYWORD

nonn

AUTHOR

Colin Barker, Jul 26 2014

EXTENSIONS

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

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 23 13:59 EDT 2021. Contains 345402 sequences. (Running on oeis4.)