This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A089197 Nonadjacent Fibonacci currency: number of ways to make change for n units in a currency system with coins of value 1, 2, 5, 13, 34, 89, ..., Fibonacci(2k-1). 4
 1, 1, 2, 2, 3, 4, 5, 6, 7, 8, 10, 11, 13, 15, 17, 20, 22, 25, 28, 31, 35, 38, 42, 46, 50, 55, 60, 65, 71, 76, 83, 89, 96, 103, 111, 119, 128, 136, 146, 156, 167, 178, 189, 201, 214, 227, 241, 255, 270, 286, 302, 319, 337, 355, 375, 394, 415, 436, 458, 481, 505, 529, 555 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Each amount can be paid using at most two ones and each larger coinage at most once. (Zeckendorf) LINKS Alois P. Heinz, Table of n, a(n) for n = 0..10000 FORMULA G.f.: 1/(1-x^1)/(1-x^2)/(1-x^5)/(1-x^13)/(1-x^34)/(1-x^89) ... . MATHEMATICA <

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.

Last modified January 20 14:40 EST 2019. Contains 319333 sequences. (Running on oeis4.)