close
login
A218381
Numbers k = i*j such that i+j is a square.
8
3, 4, 8, 14, 15, 18, 20, 24, 28, 35, 39, 46, 48, 55, 60, 63, 64, 66, 68, 80, 84, 94, 99, 100, 114, 120, 124, 126, 128, 136, 138, 143, 144, 150, 154, 155, 156, 158, 168, 180, 183, 195, 196, 203, 220, 224, 234, 238, 240, 243, 255, 258, 260, 275, 284, 288, 291
OFFSET
1,1
COMMENTS
Original name: Numbers k such that A211996(k) is not zero
For any n, the equation x^4 + a(n)*y^4 = z^2 is solvable in integers. - Arkadiusz Wesolowski, Aug 15 2013
The asymptotic density of this sequence is 0 (De Koninck et al., 2024). - Amiram Eldar, Nov 05 2024
LINKS
David Clark, An arithmetical function associated with the rank of elliptic curves, Canad. Math. Bull. Vol. 34 (2), (1991), pp. 181-185.
Jean-Marie De Koninck, A. Arthur Bonkli Razafindrasoanaivolala, and Hans Schmidt Ramiliarimanana, Integers with a sum of co-divisors yielding a square, Research in Number Theory, Vol. 10, No. 2 (2024), Article 30; author's copy.
MATHEMATICA
q[k_] := DivisorSum[k, 1 &, #^2 <= k && IntegerQ[Sqrt[# + k/#]] &] > 0; Select[Range[300], q] (* Amiram Eldar, Nov 05 2024 *)
PROG
(PARI) is(k) = k > 1 && fordiv(k, d, if(issquare(d + k/d), return(1)); if(d^2 > k, return(0))); \\ Amiram Eldar, Nov 05 2024
(Python)
from itertools import count, islice
from sympy import divisors
from sympy.ntheory.primetest import is_square
def A218381_gen(startvalue=1): # generator of terms >= startvalue
for k in count(max(startvalue, 1)):
for d in divisors(k):
if d**2>k:
break
if is_square(k//d+d):
yield k
break
A218381_list = list(islice(A218381_gen(), 30)) # Chai Wah Wu, Jun 18 2026
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Marcus, Oct 27 2012
EXTENSIONS
Simpler name from M. F. Hasler, Jun 18 2026
STATUS
approved