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

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

Offset

0,3

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

<<DiscreteMath`Rsolve`; a[n_Integer] := SeriesTerm[1/(1-x^1)/(1-x^2)/(1-x^5)/(1-x^13)/(1-x^34)/(1-x^89), {x, 0, n}]

Crossrefs

Cf. A000045, A003107.

Sequence in context: A367253 A033552 A062420 * A017874 A029016 A290807

Adjacent sequences: A089194 A089195 A089196 * A089198 A089199 A089200

Keyword

easy,nonn

Author

Wouter Meeussen, Dec 08 2003

Extensions

Incorrect comment deleted by Peter Munn, Nov 14 2022

Status

approved