cp's OEIS Frontend

A143697 Least square k^2 such that n^2-k^2 = p*q with p and q odd primes and p for n>= 4.

%I A143697 #9 Sep 23 2019 14:58:24
%S A143697 1,4,1,16,9,4,9,36,1,36,9,4,9,36,1,144,9,4,81,36,25,36,9,16,81,144,1,
%T A143697 144,81,16,9,36,25,36,81,4,9,144,1,576,9,4,225,36,25,144,9,64,81,36,
%U A143697 49,144,9,16,225,144,1,324,81,16,9,36,25,36,225,4,9,144,1,36,225
%N A143697 Least square k^2 such that n^2-k^2 = p*q with p and q odd primes and p<q for n>= 4.
%C A143697 The product p*q is the sum of p consecutive odd numbers with 2*n-1 the greatest.
%C A143697 For n=4 p*q=3*5=15, 15=7+5+3
%C A143697 For n=5 p*q=3*7=21, 21=9+7+5
%C A143697 For n=6 p*q=5*7=35, 35=11+9+7+5+3
%C A143697 For n=7 p*q=3*11=33, 33=13+11+9
%C A143697 k^2 is the sum of the k first consecutive odd numbers p=n-k and q=n+k.
%C A143697 Assuming a strong version of the Goldbach conjecture, every term exists and we have a(n)=A082467(n)^2, p(n)=A078587(n) and q(n)=A078496(n). [_T. D. Noe_, Jan 22 2009]
%H A143697 Pierre CAMI, <a href="/A143697/b143697.txt">Table of n, a(n) for n = 4..60000</a>
%e A143697 4*4-1=3*5 p=3 q=5
%e A143697 5*5-4=3*7 p=3 q=7
%e A143697 6*6-1=5*7 p=5 q=7
%e A143697 7*7-16=3*11 p=3 q=11
%o A143697 (PARI) a(n) = {for (k=1, n-1, my(x=n^2-k^2); if ((omega(x)==2) && (bigomega(x)==2) && (x%2), return(k^2);););} \\ _Michel Marcus_, Sep 23 2019
%Y A143697 Cf. A078587, A078496.
%K A143697 nonn
%O A143697 4,2
%A A143697 _Pierre CAMI_, Aug 29 2008