Hsu, Leetsch Charles; Shiue, Peter Jau-Shyong; Wang, Yi Notes on a conjecture for Singmaster. (English) Zbl 0845.11006 Fibonacci Q. 33, No. 5, 392-397 (1995). A sequence \(\{a_i\}^n_{i= 1}\) of positive integers in nondecreasing order is a sum=product sequence of size \(n\) if \(\sum^n_{i= 1} a_i= \prod^n_{i= 1} a_i\). It is easily shown that \(\{2, 2\}\), \(\{1, 2, 3\}\), and \(\{1, 1, 2, 4\}\) are the only sum=product sequences having sizes 2, 3, and 4 respectively. Let \(N(n)\) denote the number of different sum=product sequences of size \(n\). The authors give an explicit expression for \(N(n)\). Also, let \(N(n, k)\) denote the number of different (sum)\(^k\)=product sequences of size \(n\) \((n> k\geq 2)\). Then it is proved that \(N(n, k)= \infty\). Reviewer: E.L.Cohen (Ottawa) MSC: 11A25 Arithmetic functions; related numbers; inversion formulas 11D72 Diophantine equations in many variables 11D41 Higher degree equations; Fermat’s equation Keywords:number of sum=product sequences; (sum)\(^ k\)=product sequences PDFBibTeX XMLCite \textit{L. C. Hsu} et al., Fibonacci Q. 33, No. 5, 392--397 (1995; Zbl 0845.11006)