相关论文: Narayana Sequence and The Brocard-Ramanujan Equati…

We study an extension to the uniqueness conjecture for Markov numbers. For any three positive integers $m\geq a$ and $m\geq b$ satisfying $a^2+b^2+m^2=3abm$, this conjecture states that the triple $(a,m,b)$ is uniquely determined by the…

Second order recurrence relations of real numbers arise form various applications in discrete time dynamical systems as well as in the context on Markov chains. Solutions to the recurrence relations are fully defined by the first two…

Roughly speaking, a recurrence relation is nested if it contains a subexpression of the form ... A(...A(...)...). Many nested recurrence relations occur in the literature, and determining their behavior seems to be quite difficult and…

We consider radially symmetric solutions for a class of resonant problems on a unit ball $B \subset R^n$ around the origin \[ \Delta u+\la _1 u +g(u)=f(r) \s \mbox{for $x \in B$}, \s u=0 \s \mbox{on $\partial B$} \,. \] Here the function…

The $q$-Narayana numbers $N_q(n,k)$ and $q$-Catalan numbers $C_n(q)$ are respectively defined by $$ N_q(n,k)=\frac{1-q}{1-q^n}{n\brack k}{n\brack k-1}\quad\text{and}\quad C_n(q)=\frac{1-q}{1-q^{n+1}}{2n\brack n}, $$ where ${n\brack…

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}.…

We prove that there is a one to one correspondence between the following three sets: idempotent functions on a set of size $n$, complete exceptional sequences of linear radical square zero Nakayama algebras of rank $n$ and rooted labeled…

In the first installment of this series, we proved that, for every integer $a\geq 3$ and every $m\geq 2a^2-a+2$, the 2-color Rado number of $x_1 + x_2 + \cdots + x_{m-1} = ax_m$ is $\lceil\frac{m-1}{a} \lceil\frac{m-1}{a} \rceil\rceil$.…

In this paper, we present a reduction algorithm which transforms $m$-regular partitions of $[n]=\{1, 2, ..., n\}$ to $(m-1)$-regular partitions of $[n-1]$. We show that this algorithm preserves the noncrossing property. This yields a simple…

We introduce the $2$-regular integer sequence A383066 $= (s(n))_{n \geq 1}$, which begins $0, 1, 1, 2, 3, 3, 2, \ldots$. We prove that the number of occurrences of an integer $m \geq 0$ in this sequence is equal to $\tau(m^2+1)$, the number…

The balancing numbers $B_n$ ($n=0,1,\cdots$) are solutions of the binary recurrence $B_n=6B_{n-1}-B_{n-2}$ ($n\ge 2$) with $B_0=0$ and $B_1=1$. In this paper we show several relations about the sums of product of two balancing numbers of…

Let $k \ge 2$ be even, and let $r$ be a non-zero integer. We show that for almost all $d \ge 2$ (in the sense of natural density), the equation $$ x^k+(x+r)^k+\cdots+(x+(d-1)r)^k=y^n, \qquad x,~y,~n \in \mathbb{Z}, \qquad n \ge 2, $$ has no…

For the sequence defined by \[ a(n) = \frac{n^2 - n - 1}{\gcd\big(n^2 - n - 1,\, b(n-3) + n\,b(n-4)\big)} \] Where $b(n) = (n+2)\big(b(n-1) - b(n-2)\big),$ with initial conditions $b(-1) = 0$ and $b(0) = 1$, we find that $a(n)$ contains…

Let $\{x_{n}\}_{n \geq 0}$ be the balancing-like sequence defined by $x_{n+1} = A x_{n} - x_{n-1}$, for $A>2$, where $x_0 = 0$ and $x_1 = 1$. In this paper, we demonstrate how to find all the solutions of the Diophantine equation,…

This paper presents a method of universal coding based on the Narayana series. The rules necessary to make such coding possible have been found and the length of the resulting code has been determined to follow the Narayana count.

We analyze the stopping-time and cycle structure of the normalized Collatz iteration. Using a recursive description of admissible binary sequences, we show that every integer $m \equiv 3 \pmod{4}$ arises uniquely and derive new bounds for…

We study the properties of the third order sequence $(w_n)=\left(w_n(a,b,c; r, s,t)\right)$ defined by the recurrence relation $w_n = rw_{n - 1} + sw_{n - 2} + tw_{n - 3}\, (n \ge 3)$ with $w_0 = a,\,w_1 = b,\,w_2=c$, where $a$, $b$, $c$,…

We establish a tantalizing symmetry of certain numbers refining the Narayana numbers. In terms of Dyck paths, this symmetry is interpreted in the following way: if $w_{n,k,m}$ is the number of Dyck paths of semilength $n$ with $k$…

In the proof of the irrationality of $\zeta(3)$ and $\zeta(2)$, Ap\'ery defined two integer sequences through $3$-term recurrences, which are known as the famous Ap\'ery numbers. Zagier, Almkvist--Zudilin and Cooper successively introduced…

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…