No label defined (Q4936040)

Assume \(k\) is a nonnegative integer and \(n\) a positive integer, let \(S_n(k)= 1^k+ 2^k+\cdots+n^k\). It is well known that \(\sum_{j=0}^{k-1} \binom kj S_n(j)= (1+n)^k-1\), where \(k\geq 1\), which is a recurrence on \(S_n(j)\). In this paper the author considers lacunary recurrences involving only \(S_n (mj+r)\), where \(m\), \(n\), \(r\) are fixed and \(0\leq r\leq m-1\). (For \(m=2\) or 6, the recurrences are known results as listed by formulas (1.2), (1.3) and (1.4) in the paper). He first uses two generating functions \(\prod_{u=0}^{m-1} (e^{\vartheta^ux}-1)\) and \(e^x \prod_{u=1}^{m-1} (e^{\vartheta^ux}-1)\), where \(\vartheta\) is a primitive root of unity, and shows the properties of their coefficients, then he proves his main result (formula 3.2 in theorem 3.1) on the general lacunary recurrence of \(S_n (mj+r)\). As its corollaries the author gives new proofs of formulas as mentioned above and the lacunary recurrence relation of \(S_n(4j+r)\). Finally the author shows how his method can be applied to the Bernoulli and Genocchi numbers.