Related papers: On Motzkin numbers and central trinomial coefficie…

We study M(n), the number of distinct values taken by multinomial coefficients with upper entry n, and some closely related sequences. We show that both pP(n)/M(n) and M(n)/p(n) tend to zero as n goes to infinity, where pP(n) is the number…

In this paper, we perform an arithmetization of well-formed parenthesis strings with zeros (Motzkin words) and of corresponding Motzkin paths. The transformations used are reminiscent of G\"odel numbering for mathematical objects of some…

Let $p$ be a prime with $p>3$, and let $a,b$ be two rational $p-$integers. In this paper we present general congruences for $\sum_{k=0}^{p-1}\binom ak\binom{-1-a}k\frac p{k+b}\pmod {p^2}$. For $n=0,1,2,\ldots$ let $D_n$ and $b_n$ be Domb…

For $k=1,2,\ldots$ let $H_k$ denote the harmonic number $\sum_{j=1}^k 1/j$. In this paper we establish some new congruences involving harmonic numbers. For example, we show that for any prime $p>3$ we have…

A linear combination $aT_r(m)+bT_s(n)$ of an \mbox{$r$-gonal} number $T_r(m)$ and an $s$-gonal number $T_s(n)$ with mutually coprime positive integer coefficients $a$ and $b$ produces infinitely many primes as $m$ and~$n$ varies over the…

This paper studies certain trajectories of the Collatz function. I show that if for each odd number $n$, $n\sim 3n+2$ then every positive integer $n \in \mathbb{N}\setminus 2^{\mathbb{N}}$ has the representation…

Z.-W. Sun introduced three kinds of numbers: \begin{align*}S_n=\sum_{k=0}^{n}{n\choose k}^2{2k\choose k}(2k+1),\qquad s_n=\sum_{k=0}^{n}{n\choose k}^2{2k\choose k}\frac{1}{2k-1}, \end{align*} and $S_n^{+}=\sum_{k=0}^{n}{n\choose…

There is a growing literature on sums of reciprocals of polynomial functions of recurrence relations with constant coefficients and fixed depth, such as Fibonacci and Tribonacci numbers, products of such numbers, and balancing numbers…

In his book "250 Problems in Elementary Number Theory", W.Sierpinski shows that the numbers 1+2^(2^n)+2^(2^n+1) are divisible by 21; for n=1,2,.... In this paper, we prove a similar but more general result.Consider the natural numbers of…

In 2014 Marques and Lengyel gave all of the solutions to the equation $T_n=m!$, where $T_n$ is the $n$th term of the Tribonacci sequence $0,1,1,2,4,7,13,24,\ldots$. In 2023 Alahmadi and Luca generalized their result to the equation…

A $k$-Markov number is a positive integer that appears in a positive integral solution to the Diophantine equation $x^2 + y^2 + z^2 + k(xy + xz + yz) = (3+3k)xyz$. This equation was introduced by Gyoda and Matsushita. When $k =0$, this…

We study three classes of combinatorial sums involving central binomial coefficients and harmonic numbers, odd harmonic numbers, and even indexed harmonic numbers, respectively. In each case we use summation by parts to derive recursive…

Ordinary orthogonal polynomials are uniquely characterized by the three term recurrence relations up to an overall multiplicative constant. We show that the newly discovered M-indexed orthogonal polynomials satisfy 3+2M term recurrence…

In this paper we study a family of polynomials $$S_n^{(m)}(x):=\sum_{i,j=0}^n\binom ni^m\binom nj^m\binom{i+j}ix^{i+j}\ \ (m,n=0,1,2,\ldots).$$ For example, we show that $$\sum_{k=0}^{p-1}S_k^{(0)}(x)\equiv\frac…

The aim of this paper is to prove wordlessly the sum formula of $1^{k}+2^{k}+\ldots +n^{k}$, $k\in\{1,2,3\}$.

The main result of the paper is the following. Let a non-degenerate distribution have finite moments $\mu_k$ of all orders $k=0,1,2,\ldots$. Then the sequence $\{\mu_k/k!, \; k=0,1,2,\ldots\}$ either contains infinitely many different terms…

Let $p$ be a prime and let $a$ be a positive integer. In this paper we investigate $\sum_{k=0}^{p^a-1}\binom[(h+1)k,k+d]/m^k$ modulo a prime $p$, where $d$ and $m$ are integers with $-h<d<=p^a$ and $m\not=0 (mod p)$. We also study…

Motzkin numbers are derived from a special case of Random Domino Automaton - recently proposed toy model of earthquakes. An exact solution of the set of equations describing stationary state of Random Domino Automaton in "inverse-power"…

Let $\mathcal{N}[k]$ be the multiset containing the $\binom{n-1}{k}$ products of $k$-subsets of $\{1,\ldots, n-1\}$. We show that if $n\geq (2c+3)^2$, then \begin{gather*}\left((-1)^c+\sum_{M\in \mathcal{N}[n-1-c]}M\right)\cdot(c+1)\equiv…

In this paper, we evaluate some series of the form $$\sum_{k=1}^\infty\frac{ak^2+bk+c}{k(3k-1)(3k-2)m^k\binom{4k}k}.$$ For example, we prove that $$\sum_{k=1}^\infty\frac{(5k^2-4k+1)8^{k}}{k(3k-1)(3k-2)\binom{4k}k}=\frac{3}2\pi$$ and…