OFFSET
0,8
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
Seung Kyung Park, The r-complete partitions, Discrete mathematics 183.1-3 (1998): 293-297.
Index entries for linear recurrences with constant coefficients, signature (1,1,0,0,-2,0,0,1,1,-1).
FORMULA
G.f.: q^5/qd(4)-q^5/((1-q^4)*(1-q^3))-q^6/(1-q^4) where qd(k) = Product_{i=1..k} (1-q^i).
a(n) = a(n-1) + a(n-2) - 2*a(n-5) + a(n-8) + a(n-9) - a(n-10). - Colin Barker, Jan 27 2020
MATHEMATICA
LinearRecurrence[{1, 1, 0, 0, -2, 0, 0, 1, 1, -1}, {0, 0, 0, 0, 0, 0, 0, 2, 2, 4, 5, 8, 10}, 60] (* Vincenzo Librandi, Jan 28 2020 *)
PROG
(PARI) concat([0, 0, 0, 0, 0, 0, 0], Vec(x^7*(2 - x^3 - x^4 + x^5) / ((1 - x)^4*(1 + x)^2*(1 + x^2)*(1 + x + x^2)) + O(x^60))) \\ Colin Barker, Jan 27 2020
(Magma) I:=[0, 0, 0, 0, 0, 0, 0, 2, 2, 4, 5, 8, 10]; [n le 13 select I[n] else Self(n-1) + Self(n-2) - 2*Self(n-5) + Self(n-8) + Self(n-9) - Self(n-10): n in [1..60]]; // Vincenzo Librandi, Jan 28 2020
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Jan 22 2020
STATUS
approved