2000 character limit reached
A supercongruence involving Delannoy numbers and Schröder numbers
Published 7 Jan 2016 in math.NT and math.CO | (1601.03938v1)
Abstract: The Delannoy numbers and Schr\"oder numbers are given by \begin{align*} D_n=\sum_{k=0}n{n\choose k}{n+k\choose k}\quad \text{and}\quad S_n=\sum_{k=0}n{n\choose k}{n+k\choose k}\frac{1}{k+1}, \end{align*} respectively. Let $p>3$ be a prime. We mainly prove that \begin{align*} \sum_{k=1}{p-1}D_k S_k\equiv 2p3B_{p-3}-2pH{*}_{p-1} \pmod{p4}, \end{align*} where $B_n$ is the $n$-th Bernoulli number and those $H{*}_n$ are the alternating harmonic numbers given by $H{*}n=\sum{k=1}{n}\frac{(-1)k}{k}$. This supercongruence was originally conjectured by Z.-W. Sun in 2011.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.