2000 character limit reached
Congruences involving Franel and Catalan-Larcombe-French numbers
Published 9 Feb 2015 in math.NT and math.CO | (1502.02499v3)
Abstract: Let ${f_n}$ be the Franel numbers given by $f_n=\sum_{k=0}n\binom nk3$, and let $p>5$ be a prime. In this paper we mainly determine $\sum_{k=0}{p-1} \binom{2k}k\frac{f_k}{mk}\pmod p$ for $m=5,-16,16,32,-49,50,96$. Let $S_n=\sum_{k=0}n\binom nk\binom{2k}k\binom{2n-2k}{n-k}$. We also determine $\sum_{k=0}{p-1} \binom{2k}k\frac{S_k}{mk}\pmod p$ for $m=7,16,25,32,64,160,800,1600, 156832$.
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.