Even-exponent Catalan-triangle congruence conjecture

About 17 years old · traced to

Let Bn,kB_{n,k} denote the Catalan-triangle quantities used in the paper, and let n,r,s⩾1n,r,s\geqslant 1. Even-exponent Catalan-triangle congruence conjecture.

∑k=1nk2rBn,k2s+1≡{(2n−1n),if n=2a−1,0,otherwise(mod(2nn)).\sum_{k=1}^{n}k^{2r}B_{n,k}^{2s+1} \equiv \begin{cases} \displaystyle {2n-1\choose n},&\text{if $n=2^a-1$,}\\[5pt] 0,&\text{otherwise} \end{cases} \pmod{{2n\choose n}}.

This is a complementary parity case to the preceding Catalan-triangle congruences, asserting that only indices one less than a power of two give the nonzero residue. The source supplies no resolution.

References

Primary source

Victor J. W. Guo and Jiang Zeng, “Factors of binomial sums from the Catalan triangle”, arXiv:0909.0307 (2009).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.