Nontrivial solutions of a higher-order rational difference equation

We prove that, for every k ∈ ℕ, the following generalization of the Putnam difference equation \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ x_{n + 1} = \frac{{x_n + x_{n - 1} + \cdots + x_{n - (k - 1)} + x_{n - k} x_{n - (k + 1)} }} {{x_n x_{n - 1} + x_{n - 2} + \cdots + x_{n - (k + 1)} }}, n \in \mathbb{N}_0 , $$\end{document} has a positive solution with the following asymptotics \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ x_n = 1 + (k + 1)e^{ - \lambda ^n } + (k + 1)e^{ - c\lambda ^n } + o(e^{ - c\lambda ^n } ) $$\end{document} for some c > 1 depending on k, and where λ is the root of the polynomial P(λ) = λk+2 − λ − 1 belonging to the interval (1, 2). Using this result, we prove that the equation has a positive solution which is not eventually equal to 1. Also, for the case k = 1, we find all positive eventually equal to unity solutions to the equation.