OFFSET
0,12
COMMENTS
a(n) is the number of partitions of n into parts 5, 6, and 11. - Joerg Arndt, Nov 19 2022
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..5000
Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,-1,-1,0,0,0,0,1).
FORMULA
a(n) = a(n-5) + a(n-6) + a(n-16) - a(n-17) + a(n-22) for n >= 22. - Harvey P. Dale, Jul 08 2014
MATHEMATICA
CoefficientList[Series[1/((1-x^5)(1-x^6)(1-x^11)), {x, 0, 100}], x] (* or *)
LinearRecurrence[{0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, -1, 0, 0, 0, 0, 1}, {1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 2, 1, 0, 0, 1, 2, 2, 1, 0, 1, 2}, 100] (* Harvey P. Dale, Jul 08 2014 *)
PROG
(Magma) R<x>:=PowerSeriesRing(Rationals(), 90); Coefficients(R!( 1/((1-x^5)*(1-x^6)*(1-x^11)) )); // G. C. Greubel, Nov 18 2022
(SageMath)
def A025880_list(prec):
P.<x> = PowerSeriesRing(ZZ, prec)
return P( 1/((1-x^5)*(1-x^6)*(1-x^11)) ).list()
A025880_list(90) # G. C. Greubel, Nov 18 2022
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved