login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A181896 Least value x solving x^2 - y^2 = n! 1
5, 11, 27, 71, 201, 603, 1905, 6318, 21888, 78912, 295260, 1143536, 4574144, 18859680, 80014848, 348776640, 1559776320, 7147792848, 33526120320, 160785625902, 787685472000, 3938427360000, 20082117976800, 104349745817240, 552166953609600, 2973510046027938 (list; graph; refs; listen; history; text; internal format)
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
For least y value see A038202.
Cf. A055228.
Sequence in context: A289775 A119503 A048655 * A041671 A215221 A203160
KEYWORD
nonn
AUTHOR
Artur Jasinski, Mar 31 2012
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 07:53 EDT 2024. Contains 371964 sequences. (Running on oeis4.)