Congruences involving Franel and Catalan-Larcombe-French numbers

preprint2015arXivOpen access

Abstract

Let {fn}\{f_n\} be the Franel numbers given by fn=∑k=0n(nk)3f_n=\sum_{k=0}^n\binom nk^3, and let p>5p>5 be a prime. In this paper we mainly determine ∑k=0p−1(2kk)fkmk(modp)\sum_{k=0}^{p-1} \binom{2k}k\frac{f_k}{m^k}\pmod p for m=5,−16,16,32,−49,50,96m=5,-16,16,32,-49,50,96. Let Sn=∑k=0n(nk)(2kk)(2n−2kn−k)S_n=\sum_{k=0}^n\binom nk\binom{2k}k\binom{2n-2k}{n-k}. We also determine ∑k=0p−1(2kk)Skmk(modp)\sum_{k=0}^{p-1} \binom{2k}k\frac{S_k}{m^k}\pmod p for m=7,16,25,32,64,160,800,1600,156832m=7,16,25,32,64,160,800,1600, 156832.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.