2000 character limit reached
Congruences for Catalan-Larcombe-French numbers
Published 4 May 2015 in math.NT and math.CO | (1505.00668v2)
Abstract: Let ${P_n}$ be the Catalan-Larcombe-French numbers given by $P_0=1,\ P_1=8$ and $n2P_n=8(3n2-3n+1)P_{n-1}-128(n-1)2P_{n-2}$ $(n\ge 2)$, and let $S_n=P_n/2n$. In this paper we deduce congruences for $S_{mpr}\pmod{p{r+2}}$, $S_{mpr-1}\pmod{pr}$ and $S_{mpr+1}\pmod{p{2r}}$, where $p$ is an odd prime and $m,r$ are positive integers. We also prove that $S_{(p2-1)/2}\equiv 0\pmod {p2}$ for any prime $p\equiv 5,7\pmod 8$, and show that ${S_m}$ is log-convex.
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.