Jhon J. Bravo

activity

20122025

most citedRepdigits in Narayana's Cows Sequence and their Consequences

3 citations · 5 across the 6 of their papers we have counts for

collaborators

7 papers

math.NT2025

On Pell numbers representable as product of two generalized Fibonacci numbers

Jhon J. Bravo, Pranabesh Das, Jose L. Herrera +1

A generalization of the well-known Fibonacci sequence is the $k$ -Fibonacci sequence with some fixed integer $k \geq 2$ . The first $k$ terms of this sequence are $0, 0, \dots, 1$ , and…

math.NT2020

$k$ --Fibonacci numbers with two blocks of repdigits

Eric F. Bravo, Jhon J. Bravo, Carlos A. Gómez

A generalization of the well--known Fibonacci sequence is the $k$ --Fibonacci sequence with some fixed integer $k \geq 2$ . The first $k$ terms of this sequence are $0, \dots, 0, 1$ , and…

math.NT2020★ 3 cited

Repdigits in Narayana's Cows Sequence and their Consequences

Jhon J. Bravo, Pranabesh Das, Sergio Guzmán

Narayana's cows sequence satisfies the third-order linear recurrence relation $N_{n} = N_{n - 1} + N_{n - 3}$ for $n \geq 3$ with initial conditions $N_{0} = 0$ and $N_{1} = N_{2} = 1$ . In this paper, w…

math.NT2016

Power of Two as sums of Three Pell Numbers

Jhon J. Bravo, Bernadette Faye, Florian Luca

In this paper, we find all the solutions of the Diophantine equation $P_{ℓ} + P_{m} + P_{n} = 2^{a}$ , in nonnegative integer variables $(n, m, ℓ, a)$ where $P_{k}$ is the $k$ -th term of the…

math.NT2014★ 1 cited

Powers of two as sums of two $k -$ Fibonacci numbers

Jhon J. Bravo, Carlos A. Gómez, Florian Luca

For an integer $k \geq 2$ , let $(F_{n}^{(k)})_{n}$ be the $k -$ Fibonacci sequence which starts with $0, \dots, 0, 1$ ( $k$ terms) and each term afterwards is the sum of the $k$ precedin…

math.NT2014★ 1 cited

Coincidences in generalized Lucas sequences

Eric F. Bravo, Jhon J. Bravo, Florian Luca

For an integer $k \geq 2$ , let $(L_{n}^{(k)})_{n}$ be the $k -$ generalized Lucas sequence which starts with $0, \dots, 0, 2, 1$ ( $k$ terms) and each term afterwards is the sum of the $k…

math.NT2012

On the largest prime factor of the $k -$ Fibonacci numbers

Jhon J. Bravo, Florian Luca

Let $P (m)$ denote the largest prime factor of an integer $m \geq 2$ , and put $P (0) = P (1) = 1$ . For an integer $k \geq 2$ , let $(F_{n}^{(k)})_{n \geq 2 - k}$ be the $k -$ generalized Fibonacc…