The \(k\)-generalized Lucas numbers close to a power of 2 (Q6175359)

The \(k\)-generalized Lucas numbers \(L_n^{(k)}\) are defined by \(L_0^{(k)}=k,L_n^{(k)}=2^n-1\) for \(1\leq n\leq k-1\) and \[L_n^{(k)}=L_{n-1}^{(k)}+L_{n-2}^{(k)}+\cdots+L_{n-k}^{(k)}\] for \(n\geq k\). It holds that \(L_n^{(k)}=\alpha_1^n+\cdots+\alpha_k^n\), where \((x-\alpha_1)\cdots(x-\alpha_k)=x^k-x^{k-1}-\cdots-x-1\). In the paper it is proved that the solutions of the inequality \[\left\vert L_n^{(k)}-2^m\right\vert<2^{m/2}\] in positive integers \((n,k,m)\) with \(k\geq 2\) and \(n\geq k+1\) are contained in the set \(\{(3,2,2),(4,2,3),(6,2,4),(7,2,5),\) \((7,3,6),(8,3,7),(9,3,8),(10,2,7),(13,2,9)\}\) or have \(n=m,k\geq 5\) and \(k+1\leq n<k+t_0\), where \(t=t_0\) is a positive real number satisfying \(2^{(k+t)/2}=(k+t)2^{t-1}+1\). The proof in the case \(n>m\) is rather standard using linear forms in logs to get bounds and using reduction methods to get the statement. In the case \(n=m\) the authors use a new formula for \(k\)-generalized Lucas numbers obtained from Theorem 1 in [Math. Slovaca 64, No. 2, 287--300 (2014; Zbl 1349.11037)]. The paper closes with some numerical observations and an outlook for further research (generalizing the notion of closeness of an integer in the result above).