Triple Catalan-triangle product divisibility conjecture for rows nn, 2n2n, and 3n3n

Let Bn,kB_{n,k} denote the Catalan-triangle quantities used in the paper. For positive integers r,s,tr,s,t satisfying r+s+t1(mod2)r+s+t\equiv 1\pmod 2, triple-product divisibility conjecture. The sum

k=1nBn,krB2n,ksB3n,kt\sum_{k=1}^n B_{n,k}^{r}B_{2n,k}^{s}B_{3n,k}^{t}

is divisible by both

13(6nn)\frac{1}{3}{6n\choose n}

and

(6n3n).{6n\choose 3n}.

The conjecture is stated as a refinement of the corresponding divisibility corollary, and the source leaves its full generality unresolved.

Sources & referencesView supporting material

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.