OFFSET
0,11
COMMENTS
a(n) is the number of partitions of n into parts 5, 8, and 10. - Joerg Arndt, Nov 20 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,0,0,1,0,1,0,0,-1,0,-1,0,0,-1,0,0,0,0,1).
FORMULA
a(n) = a(n-5) + a(n-8) + a(n-10) - a(n-13) - a(n-15) - a(n-18) + a(n-23). - G. C. Greubel, Nov 19 2022
a(n) = floor((n+10)*((floor(n/5) + floor((n+2)/5))/10 + floor(n/2)/40) - (41*n^2 + 360*n - 900)/800). - Hoang Xuan Thanh, Sep 20 2025
MATHEMATICA
CoefficientList[Series[1/((1-x^5)(1-x^8)(1-x^10)), {x, 0, 100}], x] (* Harvey P. Dale, Jul 26 2011 *)
PROG
(Magma) R<x>:=PowerSeriesRing(Rationals(), 90); Coefficients(R!( 1/((1-x^5)*(1-x^8)*(1-x^10)) )); // G. C. Greubel, Nov 19 2022
(SageMath)
def A025888_list(prec):
P.<x> = PowerSeriesRing(ZZ, prec)
return P( 1/((1-x^5)*(1-x^8)*(1-x^10)) ).list()
A025888_list(90) # G. C. Greubel, Nov 19 2022
(PARI) a(n) = (n^2 + 87*n + 1170 + (n+10)*(5*(-1)^n - 16*((n%5)+((n+2)%5))))\800 \\ Hoang Xuan Thanh, Sep 20 2025
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved
