Search: id:A089197
Results 1-1 of 1 results found.

%I A089197
%S A089197 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,
%T A089197 65,71,76,83,89,96,103,111,119,128,136,146,156,167,178,189,201,214,227,
%U A089197 241,255,270,286,302,319,337,355,375,394,415,436,458,481,505,529,555
%N A089197 Nonadjacent Fibonacci currency : ways to make change for n units in a 
               currency system with coins of value 1,2,5,13,34,89,..Fib(2k-1).
%C A089197 Each amount can be paid using at most two ones and each larger coinage 
               at most once. (Zeckendorf)
%F A089197 G.f.=1/(1-x^1)/(1-x^2)/(1-x^5)/(1-x^13)/(1-x^34)/(1-x^89) ...
%t A089197 <<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}]
%Y A089197 Sequence in context: A000115 A033552 A062420 this_sequence A017874 A029016 
               A121385
%Y A089197 Adjacent sequences: A089194 A089195 A089196 this_sequence A089198 A089199 
               A089200
%K A089197 easy,nonn
%O A089197 1,2
%A A089197 Wouter Meeussen (wouter.meeussen(AT)pandora.be), Dec 08 2003

Search completed in 0.001 seconds