2000 character limit reached
Narayana numbers that are products of two Fibonacci numbers
Published 23 Jul 2025 in math.NT | (2508.02688v1)
Abstract: Let be the Narayana's cows sequence given by , and [ N{m+3}=N_{m+2}+N_m,\quad \text{ for }\; m\geq 0 ] and let be the Fibonacci sequence. In this paper we solve explicitely the Diophantine equation [ N_m=F_nF_k, ] in positive unknowns and . That is, we find the non-zero narayana numbers that are products of two Fibonacci numbers.
Paper Prompts
Sign up for free to create and run prompts on this paper.