相关论文: Identities involving Narayana numbers

The Fibonacci sequence $\mathbb{F}$ is the fixed point beginning with $a$ of morphism $\sigma(a,b)=(ab,a)$. Since $\mathbb{F}$ is uniformly recurrent, each factor $\omega$ appears infinite many times in the sequence which is arranged as…

Consider a nested, non-homogeneous recursion R(n) defined by R(n) = \sum_{i=1}^k R(n-s_i-\sum_{j=1}^{p_i} R(n-a_ij)) + nu, with c initial conditions R(1) = xi_1 > 0,R(2)=xi_2 > 0, ..., R(c)=xi_c > 0, where the parameters are integers…

The subset sum problem over finite fields is a well-known {\bf NP}-complete problem. It arises naturally from decoding generalized Reed-Solomon codes. In this paper, we study the number of solutions of the subset sum problem from a…

The Nash problem asks about the existence of a correspondence between families of arcs through singularities of complex varieties and certain types of divisorial valuations. It has been positively settled in dimension 2 by Fern\'andez de…

It is shown that the unique representation of positive integers in terms of tribonacci numbers and the unique representation in terms of iterated A, B and C sequences defined from the tribonacci word are equivalent. Two auxiliary…

The Fibonacci numbers satisfy the famous recurrence $F_n = F_{n - 1} + F_{n - 2}$. The theory of C-finite sequences ensures that the Fibonacci numbers whose indices are divisible by $m$, namely $F_{mn}$, satisfy a similar recurrence for…

The interval discrete logarithm problem is defined as follows: Given some $g,h$ in a group $G$, and some $N \in \mathbb{N}$ such that $g^z=h$ for some $z$ where $0 \leq z < N$, find $z$. At the moment, kangaroo methods are the best low…

The generalized Narayana polynomials $N_{n,m}(x)$ arose from the study of infinite log-concavity of the Boros-Moll polynomials. The real-rootedness of $N_{n,m}(x)$ had been proved by Chen, Yang and Zhang. They also showed that when $n\geq…

The Tribonacci-Lucas sequence $\{S_n\}_{n\ge 0}$ is defined by the linear recurrence relation $S_{n+3} = S_{n+2} + S_{n+1} + S_n$, for $ n\ge 0 $, with the initial conditions $S_0 =S_2= 3$ and $S_1 = 1$. A palindromic number is a number…

For a fixed integer N, and fixed numbers b_1,...,b_N, we consider sequences, the nth term (a_n) of which is the sum of the squares of the terms in the expansion of (b_1 + ... + b_N)^n. In the case all b_i=1, we give a formula for a…

Reconciling gene trees with a species tree is a fundamental problem to understand the evolution of gene families. Many existing approaches reconcile each gene tree independently. However, it is well-known that the evolution of gene families…

The sequence reconstruction problem asks for the recovery of a sequence from multiple noisy copies, where each copy may contain up to $r$ errors. In the case of permutations on \(n\) letters under the Hamming metric, this problem is closely…

The initial-values problem of the following nonlinear autonomous recursion of order p , z (s + p) = c product of [z (s + l)]^a_l ; with p an arbitrary positive integer, z (s) the dependent variable (possibly a complex number), s the…

For any real-valued $k > 1$, we consider the tree rooted at 0, where each positive integer $n$ has parent $\lfloor\frac{n}{k}\rfloor$. The average number of children per node is $k$, thus this definition gives a natural way to extend…

In this paper, using properties of Ramanujan sums and of the discrete Fourier transform of arithmetic functions, we give an explicit formula for the number of solutions of the linear congruence $a_1x_1+\cdots +a_kx_k\equiv b \pmod{n}$, with…

It is well-known that for $p=1, 2, 3, 7, 11, 19, 43, 67, 163$, the class number of $\mathbb{Q}(\sqrt{-p})$ is one. We use this fact to determine all the solutions of $x^2+p^m=4y^n$ in non-negative integers $x, y, m$ and $n$.

It is shown that the first $n$ prime numbers $p_1,...,p_n$ determine the next one by the recursion equation $$ p_{n+1} =\lim\limits_{s\to +\infty} [\prod\limits^n_{k=1} (1-\frac{1}{p^s_k}) \sum\limits^\infty_{j=1} \frac{1}{j^s} -1]^{-1/s}.…

For positive integers $a,b,c$, and an integer $n$, the number of integer solutions $(x,y,z) \in \mathbb Z^3$ of $a \frac{x(x-1)}{2} + b \frac{y(y-1)}{2} + c \frac{z(z-1)}{2} = n$ is denoted by $t(a,b,c;n)$. In this article, we prove some…

In this paper we classify certain values of p that satisfy the Erdos-Straus conjecture, concerning the decomposition of fractions of the form 4/n as sum of three fractions with numerator identically equal to 1, not according to their…

We provide a formula for the $n^{th}$ term of the $k$-generalized Fibonacci-like number sequence using the $k$-generalized Fibonacci number or $k$-nacci number, and by utilizing the newly derived formula, we show that the limit of the ratio…