OFFSET
2,3
COMMENTS
Total number of parts in the partitions of n into parts of size 2 and 3. - Andrew Howroyd, Nov 10 2018
LINKS
Andrew Howroyd, Table of n, a(n) for n = 2..1000
FORMULA
From Andrew Howroyd, Nov 10 2018: (Start)
G.f.: x^2*(1 + 2*x + 2*x^2)/((1 + x + x^2)^2*(1 + x)^2*(1 - x)^3).
a(n) = Sum_{k=0..floor(n/6)} 2*k + (n-6*k)/2 for even n.
a(n) = Sum_{k=0..floor((n-3)/6)} 2*k + 1 + (n-3-6*k)/2 for odd n.
(End)
MATHEMATICA
row[n_] := Reap[Do[If[2 e2 + 3 e3 == n, Sow[{e2, e3}]], {e2, 0, n/2}, {e3, 0, n/3}]][[2, 1]];
a[n_] := row[n] // Flatten // Total;
Table[a[n], {n, 2, 100}] (* Jean-François Alcover, Nov 23 2018 *)
PROG
(PARI) Vec((1 + 2*x + 2*x^2)/((1 + x + x^2)^2*(1 + x)^2*(1 - x)^3) + O(x^60)) \\ Andrew Howroyd, Nov 10 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
Wolfdieter Lang, Nov 05 2018
EXTENSIONS
Terms a(27) and beyond from Andrew Howroyd, Nov 10 2018
STATUS
approved