Prime powers in sums of terms of binary recurrence sequences (Q2313398)

Consider the Diophantine equation \(u_{n_1}+\dots+u_{n_t}=p^z\) in non-negative integers \(n_1,\dots,n_t\) and \(z\), where \((u_n)\) is a linear recurrence sequence and \(p\) is a prime. If \((u_n)\) is a binary sequence, then under certain assumptions it is proved that the equation has only finitely many soltuins which can be effectively bounded. In the particular case where \((u_n)\) is the sequence of balancing numbers, \(t=3\) and \(p=3\), it is shown that the equation has no solutions with \(n_1>n_2>n_3\). The main tool in the proofs is Baker's method.