Polynomial values in linear recurrences. II (Q1074616): Difference between revisions

[For part I, see Publ. Math. 31, 229-233 (1984; Zbl 0557.10010).] The authors study the question whether the terms of a binary recurrent sequence \(G_ 0,G_ 1,G_ 2,..\). given by \(G_{n+1}=AG_ n-BG_{n- 1}\), \(G_ 0,G_ 1,A,B\in {\mathbb{Z}}\) can assume values of the form P(x), \(x\in {\mathbb{Z}}\), P(X)\(\in {\mathbb{Z}}[X]\) fixed, infinitely often. It turns out that if \(B=-1\) then the polynomial P must be related to a Chebyshev polynomial.