p(n,k) = number of partitions of n with palindromicity k.
If k*(k+1)/2 <= p(n) < (k+1)*(k+2)/2, then p(n) = p(n,0) + .. + p(n,k)
Let q(n,k)= number of strict partitions of n (ref.
A000009) with exactly k parts. Then p(n,k) = Sum_{j>=0} q(n-2j,k)*p(j), which affords another way to demonstrate that the convolution of q(2n-j) with p(j) equals p(2n).
p(2n,0) = p(n) and p(2n+1,0) = 0 (ref.
A025065).
p(2n,2) = p(2n-1,2) =
A014153(n-2), the second partial sum of
A000041.
G.f. for p(2n,3): p(x)* x^3*(1+x+x^2+x^3)/(1-x)*(1-x^2)*(1-x^3) where p(x) is the g.f. for
A000041.
G.f. for p(2n-1,3): p(x)* x^3*(1+2x+x^2)/(1-x)*(1-x^2)*(1-x^3) where p(x) is the g.f. for
A000041.
More generally, p(n,k>=3) = p(n-k,k-1) + p(n-2k, k-1) + p(n-3k,n-1) + ... for k>=3 = p(n-k, k-1) + p(n-k,k).