login
This site is supported by donations to The OEIS Foundation.

 

Logo


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

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

Sequence in context: A000115 A033552 A062420 * A017874 A029016 A290807

Adjacent sequences:  A089194 A089195 A089196 * A089198 A089199 A089200

KEYWORD

easy,nonn

AUTHOR

Wouter Meeussen, Dec 08 2003

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified February 23 23:56 EST 2018. Contains 299595 sequences. (Running on oeis4.)