中文
相关论文

相关论文: Identities involving Narayana numbers

200 篇论文

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, we study $b$-repdigits which are sums of two Narayana…

数论 · 数学 2020-10-14 Jhon J. Bravo , Pranabesh Das , Sergio Guzmán

Narayana's sequence is a ternary recurrent sequence defined by the recurrence relation $\mathcal{N}_n=\mathcal{N}_{n-1}+\mathcal{N}_{n-3}$ with initial terms $\mathcal{N}_0=0$ and $\mathcal{N}_1=\mathcal{N}_2=\mathcal{N}_3=1$. Let…

Let $ (N_n)_{n\ge 0}$ be the Narayana's cow sequence defined by a third-order recurrence relation $ N_0=0,\ N_1= N_2=1 $, and $ N_{n+3}=N_{n+2}+N_n $ for all $ n\ge 0 $. In this paper, we determine all Narayana numbers that are…

数论 · 数学 2022-10-04 Mahadi Ddamulira , Paul Emong , Geoffrey Ismail Mirumbe

Let $\{N_m\}_{m\ge0}$ be the Narayana's cows sequence given by $N_0=0$, $N_1=1=N_2=1$ and \[ N_{m+3}=N_{m+2}+N_m,\quad \text{ for }\; m\geq 0 \] and let $\{F_n\}_{n\ge0}$ be the Fibonacci sequence. In this paper we solve explicitely the…

数论 · 数学 2025-08-06 Japhet Odjoumani

Let $(N_{n})_{n\ge 0}$ be Narayana's cows sequence given by a recurrence relation $ N_{n+3}=N_{n+2}+N_n $ for all $ n\ge 0 $, with initial conditions $ N_0=0 $, and $ N_1= N_2=1 $. In this paper, we find all members in Narayana's cow…

数论 · 数学 2024-01-01 Mahadi Ddamulira , Paul Emong , Geoffrey Ismail Mirumbe

In this paper,we find all generalized Fibonacci numbers which are Narayana's cows numbers. In our proofs, we use both Baker's theory of nonzero linear forms in logarithms of algebraic numbers and the Baker-Davenport reduction method.

数论 · 数学 2023-02-21 Hayat Bensella , Djilali Behloul

We define the Narayana sequence $\{a_n\}_{n\geq 0}$ as the one satisfying the linear recurrence relation $a_n = a_{n-1}+a_{n-3}$ for $n\geq 3$, with initial values $a_0 = 0$ and $a_1 = a_2=1$. In this paper, we fully characterize the…

数论 · 数学 2021-12-28 Russelle Guadalupe

Let $\left\lbrace a_{n}\right\rbrace_{n\geq 0}$ be the Narayana Sequence defined by the recurence $a_{n}=a_{n-1}+a_{n-3}$ for all $n\geq 3$ with intital values $a_{0}=0$ and $a_{1}=a_{2}=1$. In This paper, we fully characterize the $3-$adic…

数论 · 数学 2022-06-22 Mustafa Ismail , Salah Rihanaa , M. Anwar

For the Fibonacci numbers $F_n$, we have the self-convolution formula $5 \sum_{i=0}^n F_i F_{n-i} = (2n)F_{n+1} - (n+1)F_n$. We find the corresponding self-convolution formula for the Narayana numbers $R_n$ which satisfy $R_n = R_{n-1} +…

组合数学 · 数学 2026-05-22 Greg Dresden , Yuechen Xiao , Guanzhang Zhou

In this paper, we show that there are only finitely many Narayana's numbers which can be written as product of three repdigits in base $g$ with $g \geq 2$. Moreover, for $2 \leq g \leq 10$, we determine all these numbers.

综合数学 · 数学 2023-07-14 Pagdame Tiebekabe , K. R. Kakanou , H. Ben Yakkou

In this paper, we focus on Narayana numbers which can be written as a products of four repdigits in base $g$, where $g$ is an integer with $g\geq2$. We prove that for $g$ between $2$ and $12$, there are finitely many of these numbers.…

综合数学 · 数学 2025-10-23 Passimzouwé Dagou , Pagdame Tiebekabe , Kokou Tcharie

Let $\mathcal{P}_{n}$ be the $n$-th Padovan number, $E_{n}$ be the $n$-th Perrin number and $N_{n}$ be the $n$-th Narayana's cows number. Let $b$ be a positive integer such that $b \geq 2$. In this paper, we study the Diophantine equations…

The Lucas polynomials, $\{n\}$, are polynomials in $s$ and $t$ given by $\{ n \} = s \{ n-1 \} + t \{ n-2 \}$ for $n \geq 2$ with $ \{ 0 \} = 0$ and $\{ 1 \} = 1$. The lucanomial coefficients, an analogue of the binomial coefficients, are…

组合数学 · 数学 2019-10-22 Kristina Garrett , Kendra Killpatrick

The Narayana numbers are $N(n,k) = {1 \over n}{n \choose k}{n \choose {k+1}}$. There are several natural statistics on Dyck paths with a distribution given by N(n,k). We show the equidistribution of Narayana statistics by computing the flag…

组合数学 · 数学 2012-04-18 Petter Brändén

In this paper, we find all repdigits which can be expressed as the product of a Narayana, and a product of two repdigits is Narayana.

数论 · 数学 2023-04-19 G. Abou-Elela , A. Elsonbaty , M. Anwar

For an integer $k \geq 2$, let $\{ P_{n}^{(k)} \}_{n}$ be the $k$-generalized Pell sequence which starts with $0, \dots,0,1$($k$ terms) and each term afterwards is the sum of $k$ preceding terms. In this paper, we find all the solutions of…

数论 · 数学 2023-07-11 Bibhu Prasad Tripathy , Bijan Kumar Patel

We consider the generalized Fibonacci counting problem with rabbits that become fertile at age $f$ and die at age $d$, with $1<=f<=d$ and $d$ finite or infinite. We provide a simple proof, based exclusively on a counting argumentation, for…

历史与综述 · 数学 2025-04-10 Roberto De Prisco

In this note, by counting some colored plane trees we obtain several binomial identities. These identities can be viewed as specific evaluations of certain generalizations of the Narayana polynomials. As consequences, it provides…

组合数学 · 数学 2015-12-15 Ricky X. F. Chen , Christian M. Reidys

We first establish the result that the Narayana polynomials can be represented as the integrals of the Legendre polynomials. Then we represent the Catalan numbers in terms of the Narayana polynomials by three different identities. We give…

组合数学 · 数学 2008-05-12 Toufik Mansour , Yidong Sun

We survey and prove properties a family of recurrences bears in relation to integer representations, compositions, the Pascal triangle, sums of digits, Nim games and Beatty sequences.

数论 · 数学 2017-04-17 Christian Ballot
‹ 上一页 1 2 3 10 下一页 ›