The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.


(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A260375 Numbers k such that A260374(k) is a perfect square. 1
0, 1, 2, 4, 5, 6, 7, 8, 10, 11, 14, 15, 16 (list; graph; refs; listen; history; text; internal format)
There are a surprising number of small terms in this sequence.
Heuristic: The square root of x has an average distance of 1/4 to an integer, so |x - round(sqrt(x))^2| is around |x - (sqrt(x) - 1/4)^2| or about sqrt(x)/2, hence A260374(n) is around sqrt(n!)/2. By Stirling's approximation this is around (n/e)^(n/2) which is a square with probability (n/e)^(-n/4). The integral of this function converges, so this sequence should be finite. This heuristic is crude, though, because it does not model the extreme values of A260374. - Charles R Greathouse IV, Jul 23 2015
There are no further terms up to 10^5, so probably the list is complete. - Charles R Greathouse IV, Jul 23 2015
6! = 720. The nearest perfect square is 729. The difference is 9, which is itself a perfect square. So, 6 is in this sequence.
(PARI) is(n)=my(N=n!, s=sqrtint(N)); issquare(min(N-s^2, (s+1)^2-N)) \\ Charles R Greathouse IV, Jul 23 2015
from gmpy2 import isqrt, is_square
A260375_list, g = [0], 1
for i in range(1, 1001):
g *= i
s = isqrt(g)
t = g-s**2
if is_square(t if t-s <= 0 else 2*s+1-t):
A260375_list.append(i) # Chai Wah Wu, Jul 23 2015
Sequence in context: A086743 A285432 A039079 * A361144 A188160 A047571

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 June 13 10:09 EDT 2024. Contains 373383 sequences. (Running on oeis4.)