  In a recent article, Apagodu and Zeilberger
(http://arxiv.org/abs/1606.03351)discuss some applications of an algorithm for
finding and proving congruence identities (modulo primes) of indefinite sums of
many combinatorial sequence. At the end, they propose some supercongruences as
conjectures. Here we prove one of them, including a new companion enumerating
abelian squares, and we leave some remarks for the others.
