OFFSET
28,7
LINKS
FORMULA
a(n) = Sum_{o=1..floor(n/7)} Sum_{m=o..floor((n-o)/6)} Sum_{l=m..floor((n-m-o)/5)} Sum_{k=l..floor((n-l-m-o)/4)} Sum_{j=k..floor((n-k-l-m-o)/3)} Sum_{i=j..floor((n-j-k-l-m-o)/2)} [Omega(o) = Omega(m) = Omega(l) = Omega(k) = Omega(j) = Omega(i) = Omega(n-i-j-k-l-m-o) = 2], where Omega is the number of prime factors with multiplicity (A001222) and [ ] is the (generalized) Iverson bracket.
a(n) = [x^n y^7] 1/Product_{j>=1} (1-y*x^A001358(j)). - Alois P. Heinz, May 21 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, May 12 2021
STATUS
approved
