Let be a sequence of integers. Its dual sequence is defined by \begin{equation*} a_n^* := \sum_{k=0}^{n} \binom{n}{k}(-1)^k a_k. \end{equation*} Let be a prime. In this paper we mainly investigate congruences modulo involving central binomial coefficients and -adic dual sequences. For example, we prove that for any sequence of -adic integers, \begin{align*} \sum^{(p-1)/2}{k=0}\binom{2k}{k}^2\frac{a{2k}}{16^k}\equiv\left( \frac{-1}{p}\right) \sum_{k=0}^{p-1}\frac{{k}}{16 ^{k}}a{k}^\pmod{p^2}, \end{align} where are the Catalan–Larcombe–French numbers given by \begin{equation*} _0=1,\quad 1=8, \quad n^2 n = 8(3n^2-3n+1){n-1}-128(n-1)^2{n-2} \quad (n\ge2). \end{equation*} We also establish a new formula for and as a consequence we confirm some conjectures of Z.-W. Sun \cite{Sun2014CANT} on the generalized central trinomial coefficients , i.e., the coefficient of in , where are integers.

生成讲解博客的中文版本

生成AI智能校验的中文版本