\(p^{q}\)-Catalan numbers and squarefree binomial coefficients (Q1394917)

Generalized Catalan numbers may be defined by \[ F(s,n)= {1\over (s-1)n+1}{sn \choose n} \] where the integer \(s\geq 2\). (The case \(s=2\) corresponds to ordinary Catalan numbers.) The author presents several results concerning the case \(s=p^\alpha\) where \(p\) is prime. His main result is that \[ F(p,n) \equiv\begin{cases} 1\pmod p\quad & \text{if }n={p^k-1 \over p-1}\\ 0\pmod p\quad & \text{otherwise}.\end{cases} \] {}.