Consider the polynomials $$f_n(q)=\prod_{j=1}^n(1+q^j) \qquad \text{and} \qquad g_m(q)=1+q+q^2+\cdots+q^m.$$ I'll list a few examples to motivate my question. Direct calculations show that $$f_1=g_1, \qquad f_2=g_3, \qquad f_3=g_6+q^3g_0, \qquad f_4=g_{10}+q^3g_4, \qquad f_5=g_{15}+q^3g_9+q^5g_5, \qquad etc.$$
I would then ask:
QUESTION 1. Are there (numerical) coefficients $a_k\in\mathbb{Z}$ such that the following holds? $$f_n(q)=\sum_{k\geq0}a_k\cdot q^k\cdot g_{\binom{n+1}2-2k}(q).$$
QUESTION 2. If so, are $a_k\geq0$?
Postscript. Richard Stanley responded with a confirmation to the above questions. If it is alright, I like to change them to the following: can you find the coefficients $a_k$ explicitly?
Remark. If Question 2 is answered positively, then we get a new proof of $f_n$ being symmetric and unimodal.