OFFSET
0,15
COMMENTS
a(n) is the number of partitions of n into parts 6, 7, and 8. - Joerg Arndt, Jan 22 2024
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,0,1,1,1,0,0,0,0,-1,-1,-1,0,0,0,0,0,1).
FORMULA
a(n) = a(n-6) + a(n-7) + a(n-8) - a(n-13) - a(n-14) - a(n-15) + a(n-21). - Harvey P. Dale, Aug 17 2014
a(n) = floor((n^2+21*n+686)/672 + (n+10)*(-1)^n/96 - ((3*n^2) mod 7)/7). - Hoang Xuan Thanh, Sep 24 2025
MATHEMATICA
CoefficientList[Series[1/((1-x^6)(1-x^7)(1-x^8)), {x, 0, 100}], x] (* Harvey P. Dale, Aug 17 2014 *)
PROG
(Magma) R<x>:=PowerSeriesRing(Integers(), 100); Coefficients(R!( 1/((1-x^6)*(1-x^7)*(1-x^8)) )); // G. C. Greubel, Jan 22 2024
(SageMath)
def A025897_list(prec):
P.<x> = PowerSeriesRing(ZZ, prec)
return P( 1/((1-x^6)*(1-x^7)*(1-x^8))).list()
A025897_list(100) # G. C. Greubel, Jan 22 2024
(PARI) a(n) = (n^2+21*n+686 + 7*(n+10)*(-1)^n - 96*((3*n^2)%7))\672 \\ Hoang Xuan Thanh, Sep 24 2025
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved
