OFFSET
0,2
COMMENTS
Equals triangle A152205 as an infinite lower triangular matrix * the triangular numbers: [1, 3, 6, ...]. - Gary W. Adamson, Feb 14 2010
a(n) is the number of partitions of n into four kinds of parts 1 and two kinds of parts 2. - Joerg Arndt, Mar 09 2016
LINKS
Index entries for linear recurrences with constant coefficients, signature (4,-4,-4,10,-4,-4,4,-1).
FORMULA
a(n) = (n+4)*(2*n^4 + 32*n^3 + 172*n^2 + 352*n + 15*(-1)^n + 225)/960. - R. J. Mathar, Apr 01 2010
From Antal Pinter, Jan 08 2016: (Start)
a(n) = C(n + 3, 3) + 2*C(n + 1, 3) + 3*C(n - 1, 3) + 4*C(n - 3, 3) + ...
a(n) = Sum_{i = 1..z} i*C(n + 5 - 2*i,3) where z = (2*n + 3 + (-1)^n)/4.
(End)
a(n) = Sum_{i = 0..n} A002624(i). - Antal Pinter, May 05 2016
MATHEMATICA
CoefficientList[Series[1/((1 - x)^4 (1 - x^2)^2), {x, 0, 40}], x] (* Vincenzo Librandi, Feb 14 2016 *)
LinearRecurrence[{4, -4, -4, 10, -4, -4, 4, -1}, {1, 4, 12, 28, 58, 108, 188, 308}, 100] (* G. C. Greubel, Nov 25 2016 *)
PROG
(PARI) Vec(1/((1-x)^4*(1-x^2)^2)+O(x^99)) \\ Charles R Greathouse IV, Sep 26 2012
(Magma) [(n+4)*(2*n^4+32*n^3+172*n^2+352*n+15*(-1)^n+225)/960: n in [0..40]]; // Vincenzo Librandi, Feb 14 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved