OFFSET
0,4
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
Bailor Tow, Coin changing problem, Maths StackExchange
Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,0,0,1,-1).
FORMULA
From Colin Barker, Feb 22 2017: (Start)
a(n) = a(n-1) + a(n-10) - a(n-11) for n>10.
G.f.: x*(1 + x^2 - x^4 + x^5 + x^7 - 2*x^9) / ((1 - x)^2*(1 + x)*(1 - x + x^2 - x^3 + x^4)*(1 + x + x^2 + x^3 + x^4)).
(End)
MATHEMATICA
CoefficientList[Series[x (1 + x^2 - x^4 + x^5 + x^7 - 2 x^9)/((1 - x)^2*(1 + x) (1 - x + x^2 - x^3 + x^4) (1 + x + x^2 + x^3 + x^4)), {x, 0, 103}], x] (* Michael De Vlieger, Feb 22 2017 *)
PROG
(PARI) concat(0, Vec(x*(1 + x^2 - x^4 + x^5 + x^7 - 2*x^9) / ((1 - x)^2*(1 + x)*(1 - x + x^2 - x^3 + x^4)*(1 + x + x^2 + x^3 + x^4)) + O(x^100))) \\ Colin Barker, Feb 22 2017
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Marko Riedel, Jul 25 2014
EXTENSIONS
a(0)=0 prepended by Alois P. Heinz, May 26 2015
STATUS
approved