Two new kinds of numbers and related divisibility results
Abstract: We mainly introduce two new kinds of numbers given by $$R_n=\sum_{k=0}n\binom nk\binom{n+k}k\frac1{2k-1}\quad\ (n=0,1,2,...)$$ and $$S_n=\sum_{k=0}n\binom nk2\binom{2k}k(2k+1)\quad\ (n=0,1,2,...).$$ We find that such numbers have many interesting arithmetic properties. For example, if $p\equiv1\pmod 4$ is a prime with $p=x2+y2$ (where $x\equiv1\pmod 4$ and $y\equiv0\pmod 2$), then $$R_{(p-1)/2}\equiv p-(-1){(p-1)/4}2x\pmod{p2}.$$ Also, $$\frac1{n2}\sum_{k=0}{n-1}S_k\in\mathbb Z\ \ {and}\ \ \frac1n\sum_{k=0}{n-1}S_k(x)\in\mathbb Z[x]\quad\text{for all}\ n=1,2,3,...,$$ where $S_k(x)=\sum_{j=0}k\binom kj2\binom{2j}j(2j+1)xj$. For any positive integers $a$ and $n$, we show that, somewhat surprisingly, $$\frac1{n2}\sum_{k=0}{n-1}(2k+1)\binom{n-1}ka\binom{-n-1}ka\in\mathbb Z\ \ {and} \ \ \frac 1n\sum_{k=0}{n-1}\frac{\binom{n-1}ka\binom{-n-1}ka}{4k2-1}\in\mathbb Z.$$ We also solve a conjecture of V.J.W. Guo and J. Zeng, and pose several conjectures for further research.
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.