OFFSET
0,13
COMMENTS
a(n) is the number of partitions of n into parts 6, 7, and 12. - Michel Marcus, Jan 23 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,0,0,0,0,1,-1,0,0,0,0,-1,-1,0,0,0,0,0,1).
FORMULA
a(n) = floor((n+12)*(n+48 - 14*(n mod 6))/1008 + ((5*n^2+6*n+3) mod 7)/7). - Hoang Xuan Thanh, Sep 24 2025
MATHEMATICA
CoefficientList[Series[1/((1-x^6)(1-x^7)(1-x^12)), {x, 0, 100}], x] (* Harvey P. Dale, Nov 27 2020 *)
PROG
(Magma) R<x>:=PowerSeriesRing(Integers(), 100); Coefficients(R!( 1/((1-x^6)*(1-x^7)*(1-x^(12))) )); // G. C. Greubel, Jan 23 2024
(SageMath)
def A025901_list(prec):
P.<x> = PowerSeriesRing(ZZ, prec)
return P( 1/((1-x^6)*(1-x^7)*(1-x^(12)))).list()
A025901_list(100) # G. C. Greubel, Jan 23 2024
(PARI) a(n) = ((n+12)*(n+48-14*(n%6)) + 144*((5*n^2+6*n+3)%7))\1008 \\ Hoang Xuan Thanh, Sep 24 2025
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved
