Euler polynomials and combinatoric convolution sums of divisor functions with even indices (Q1723774)

Summary: We study combinatoric convolution sums of certain divisor functions involving even indices. We express them as a linear combination of divisor functions and Euler polynomials and obtain identities \[ D_{2k}(n) = \tfrac14 \sigma_{2k+1,0}(n;2) - 2 \cdot 4^{2k} \sigma_{2k+1}(n/4) - \] \[ \frac12 \left[\sum_{d\mid n,\ d \equiv 1(4)} \{E_{2k}(d) + E_{2k}(d-1) \} + 2^{2k}\sum_{d\mid n,\ d \equiv 1 (2)} E_{2k}((d +(-1)^{(d-1)/2})/2)\right], \] \[ U_{2k}(p,q) = 2^{2k-2} [-((p+q)/2) E_{2k}((p+q)/2+1) +((q - p)/2) E_{2k}((q - p)/2) - \] \[E_{2k}((p + 1) / 2) - E_{2k}((q + 1)/2) + E_{2k+1}((p + q)/2 + 1) - E_{2k+1}((q - p) / 2)],\] and \[ F_{2k}(n) = \frac12 \left\{\sigma_{2k + 1}^\dagger(n) - \sigma_{2k}^\dagger(n) \right\}\]. As applications of these identities, we give several concrete interpretations in terms of the procedural modelling method.