English
Related papers

Related papers: On Motzkin numbers and central trinomial coefficie…

200 papers

For each positive integer $m$, the $m$th order harmonic numbers are given by $$H_n^{(m)}=\sum_{0<k\le n}\frac1{k^m}\ \ (n=0,1,2,\ldots).$$ We discover exact values of some series involving harmonic numbers of order not exceeding four. For…

Number Theory · Mathematics 2025-03-04 Zhi-Wei Sun

Let $p$ be an odd prime and let $a,m$ be integers with $a>0$ and $m \not\equiv0\pmod p$. In this paper we determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}/m^k$ mod $p^2$ for $d=0,1$; for example,…

Number Theory · Mathematics 2016-02-16 Zhi-Wei Sun

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…

Number Theory · Mathematics 2021-07-19 Takao Komatsu , Gopal Krishna Panda

As a well-known enumerative problem, the number of solutions of the equation $m=m_1+...+m_k$ with $m_1\leqslant...\leqslant m_k$ in positive integers is $\Pi(m,k)=\sum_{i=0}^k\Pi(m-k,i)$ and $\Pi$ is called the additive partition function.…

Combinatorics · Mathematics 2018-05-01 Daniel Yaqubi , Madjid Mirzavaziri

The Sun polynomials $g_n(x)$ are defined by \begin{align*} g_n(x)=\sum_{k=0}^n{n\choose k}^2{2k\choose k}x^k. \end{align*} We prove that, for any positive integer $n$, there hold \begin{align*} &\frac{1}{n}\sum_{k=0}^{n-1}(4k+3)g_k(x)…

Number Theory · Mathematics 2015-12-29 Victor J. W. Guo , Guo-Shuai Mao , Hao Pan

The divisibility and congruence of usual and generalized central trinomial coefficients have been extensively investigated. The present paper is devoted to analytic properties of these numbers. We show that usual central trinomial…

Combinatorics · Mathematics 2023-05-17 Huyile Liang , Yaling Wang , Yi Wang

We present a new formula for the highest power of $a+b$ that divides the sum $B(n,m,a,b)=\sum_{k=0}^{n}\binom{n}{k}^m a^{n-k}b^k$ for the case $m=2$. By using this formula, we give complete 3-adic valuation for central Dellanoy numbers.…

Number Theory · Mathematics 2023-11-27 Jovan Mikić

Let $n$ be any nonnegative integer and \[ D_n^{(h)}(x)=\sum_{k=0}^{n}\binom{n+k}{2k}^{h}\binom{2k}{k}^{h}{x}^{k} \text{ and } S_{n}^{(h)}(x)=\sum_{k=0}^{n}\binom{n+k}{2k}^{h}C_{k}^{h}{x}^{k} \] be the generalized Delannoy polynomials and…

Number Theory · Mathematics 2025-03-18 Lin-Yue Li , Rong-Hua Wang

For integers $n,k \geq 1$, let $S_k(n)$ denote the power sum $1^k +2^k + \cdots + n^k$. In this note, we first recall the minimal recurrence relation connecting $S_k(n)$ and $S_{k-1}(n)$ established by Abramovich (1973). We then discuss an…

History and Overview · Mathematics 2026-01-30 José L. Cereceda

The harmonic numbers $H_n=\sum_{0<k\le n}1/k\ (n=0,1,2,\ldots)$ play important roles in mathematics. Let $p>3$ be a prime. With helps of some combinatorial identities, we establish the following two new congruences:…

Number Theory · Mathematics 2016-02-25 Guo-Shuai Mao , Zhi-Wei Sun

For any $m,n\in\mathbb{N}$ we first give new proofs for the following well known combinatorial identities \begin{equation*} S_n(m)=\sum\limits_{k=1}^n\binom{n}{k}\frac{(-1)^{k-1}}{k^m}=\sum\limits_{n\geq r_1\geq r_2\geq...\geq r_m\geq…

Number Theory · Mathematics 2017-03-21 Necdet Batir

For $k\geq 0$, a $k$-generalized Markov number is an integer which appears in some positive integer solution to the $k$-generalized Markov equation $x^2 + y^2 + z^2 + k(yz + zx + xy) = (3 + 3k)xyz$. In this paper, we discuss a combinatorial…

Number Theory · Mathematics 2025-03-07 Yasuaki Gyoda , Shuhei Maruyama , Yusuke Sato

The coefficients c(n,k) defined by (1-k^2x)^(-1/k) = sum c(n,k) x^n reduce to the central binomial coefficients for k=2. Motivated by a question of H. Montgomery and H. Shapiro for the case k=3, we prove that c(n,k) are integers and study…

Number Theory · Mathematics 2015-05-13 Armin Straub , Tewodros Amdeberhan , Victor H. Moll

Let $ p \ge 5 $ be a prime and let $ b, c \in \mathbb{Z} $. Denote by $ T_k(b,c) $ the generalized central trinomial coefficient, i.e., the coefficient of $ x^k $ in $ (x^2 + bx + c)^k $. In this paper, we establish congruences modulo $ p^3…

Number Theory · Mathematics 2026-01-01 Yassine Otmani , Hacene Belbachir

In 1960, W. Sierpinski proved that there are infinitely many positive odd numbers $k$, such that for any positive integer $n$, $k\times2^n+1$ is a composite number. Such numbers are called "Sierpinski numbers". In this study, by using…

Number Theory · Mathematics 2021-06-15 Chi Zhang

In this paper, we study some supercongruences involving the sequence $$ t_n(x)=\sum_{k=0}^n\binom{n}{k}\binom{x}{k}\binom{x+k}{k}2^k $$ and solve some open problems. For any odd prime $p$ and $p$-adic integer $x$, we determine…

Number Theory · Mathematics 2025-10-14 Hui-Li Han , Chen Wang

In this paper, we study the asymptotic behavior of the following function $$M_k(n):=(-1)^{k-1} \sum_{j=0}^{k-1}\big(p(n-j(3j+1)/2)-p(n-j(3j+5)/2-1)\big),$$ which arises from Andrews and Merca's truncated pentagonal number theorem.

Number Theory · Mathematics 2018-08-02 Shane Chern

The partial Stirling numbers T_n(k) used here are defined as the sum over odd values of i of (n choose i) i^k. Their 2-exponents nu(T_n(k)) are important in algebraic topology. We provide many specific results, applying to all values of n,…

Number Theory · Mathematics 2011-09-23 Donald M. Davis

Let $m$, $r$ and $n$ be positive integers. We denote by ${\bf k}\vdash n$ any tuple of odd positive integers ${\bf k}=(k_1,\dots,k_t)$ such that $k_1+\dots+k_t=n$ and $k_j\ge 3$ for all $j$. In this paper we prove that for every…

Number Theory · Mathematics 2018-04-05 Kevin Chen , Jianqiang Zhao

We investigate here the representability of integers as sums of triangular numbers, where the $n$-th triangular number is given by $T_n = n(n + 1)/2$. In particular, we show that $f(x_1,x_2,..., x_k) = b_1 T_{x_1} +...+ b_k T_{x_k}$, for…

Number Theory · Mathematics 2019-08-07 Wieb Bosma , Ben Kane