No label defined (Q4355045)

This paper concerns sums of products of \(k\) terms in a binary linear recurrence, the sum taken over all \(k\)-tuples of subscripts whose sum is a fixed integer, \(n\). The author proves several identities regarding such sums. He then applies his results to the special cases where \(k=2,3,4\), and also where, in addition, the binary linear recurrence is the Fibonacci sequence. There are a few minor errors: (1) The reviewer's name, which is quoted, is misspelled; (2) A few lines further down, the author says ``\(n\)-tuples'' where he means ``\(k\)-tuples''. One of the author's results, namely Corollary 1, part (i), was previously obtained by the reviewer [\textit{N. Robbins}, Fibonacci Q. 29, 249-255 (1991; Zbl 0734.11012), p. 250, Theorem 1a].