STATUS
editing
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A112028
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing entries 1-10 | older changes
CROSSREFS
A375178 is an essentially identical sequence.
STATUS
approved
editing
STATUS
reviewed
approved
STATUS
proposed
reviewed
STATUS
editing
proposed
LINKS
V. Vaclav Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Asymptotic of generalized Apery sequences with powers of binomial coefficients</a>, Nov 04 2012
STATUS
reviewed
editing
STATUS
proposed
reviewed
STATUS
editing
proposed
LINKS
Matthijs Coster, <a href="https://core.ac.uk/download/pdf/301642554.pdf">Supercongruences</a>, Ph.D. thesis, Universiteit Leiden, Jun 08, 1988.
FORMULA
The supercongruence a(p-1) == 1 (mod p^5) appears to hold for all primes p >= 7 (checked up to p = 199). Coster, Theorem 4, proves that a(p-1) == 1 (mod p^3) for primes p >= 5.
FORMULA
a(p-1) == 1 (mod p^4) for odd prime p.
For r >= 2, the congruence supercongruence a(p^r - 1) == a(p^(r-1) - 1) (mod p^(3*r+3)) may hold for all primes p >= 7. (End)