OFFSET
4,1
COMMENTS
Many of terms in this sequence are that same as A055228(n) but not all.
a(n) solves the Brocard-Ramanujan Problem, n! = a(n)^2 - 1, and thus (n, a(n)) are a pair of Brown Numbers, if and only if A038202(n) = 1. - Austin Hinkel, Dec 28 2022
LINKS
Eric Weisstein's World of Mathematics, Brocard's Problem.
MATHEMATICA
cc = {}; Do[f = n!/4; x = Max[Select[Divisors[f], # <= Sqrt[f] &]]; kk = f/x - x; AppendTo[cc, Sqrt[n! + kk^2]], {n, 4, 30}]; cc
PROG
(PARI) a(n)=my(N=n!, x=sqrtint(N)); while(!issquare(x++^2-N), ); x \\ Charles R Greathouse IV, Apr 10 2012
CROSSREFS
KEYWORD
nonn
AUTHOR
Artur Jasinski, Mar 31 2012
STATUS
approved