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!)
A050795 Numbers n such that n^2 - 1 is expressible as the sum of two nonzero squares in at least one way. 10

%I #38 Mar 07 2022 10:27:39

%S 3,9,17,19,33,35,51,73,81,99,105,129,145,147,161,163,179,195,201,233,

%T 243,273,289,291,297,339,361,387,393,451,465,467,483,489,513,521,577,

%U 579,585,611,627,649,675,721,723,739,777,801,809,819,849,883,899,915

%N Numbers n such that n^2 - 1 is expressible as the sum of two nonzero squares in at least one way.

%C Analogous solutions exist for the sum of two identical squares z^2-1 = 2.r^2 (e.g. 99^2-1 = 2.70^2). Values of 'z' are the terms in sequence A001541, values of 'r' are the terms in sequence A001542.

%C Looking at a^2 + b^2 = c^2 - 1 modulo 4, we must have a and b even and c odd. Taking a = 2u, b = 2v and c = 2w - 1 and simplifying, we get u^2 + v^2 = w(w+1). - _Franklin T. Adams-Watters_, May 19 2008

%C If n is in this sequence, then so is n^(2^k), for all k >= 0. - _Altug Alkan_, Apr 13 2016

%H Chai Wah Wu, <a href="/A050795/b050795.txt">Table of n, a(n) for n = 1..10000</a>

%H E.-B. Escott, <a href="/A350978/a350978.pdf">Query 2521</a>, L'Intermédiaire des Mathématiciens, 10 (1903), 285. [Contains errors]

%H <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>

%F a(n) = 2*A140612(n) + 1. - _Franklin T. Adams-Watters_, May 19 2008

%F {k : A025426(k^2-1)>0}. - _R. J. Mathar_, Mar 07 2022

%e E.g. 51^2 - 1 = 10^2 + 50^2 = 22^2 + 46^2 = 34^2 + 38^2.

%t t={}; Do[i=c=1; While[i<n&&c!=0,If[IntegerQ[Sqrt[n^2-1-i^2]],c=0; AppendTo[t,n]]; i++],{n,3,920}]; t (* _Jayanta Basu_, Jun 01 2013 *)

%t Select[Range@ 1000, Length[PowersRepresentations[#^2 - 1, 2, 2] /. {0, _} -> Nothing] > 0 &] (* _Michael De Vlieger_, Apr 13 2016 *)

%o (Python)

%o from itertools import islice, count

%o from sympy import factorint

%o def A050795_gen(startvalue=2): # generator of terms >= startvalue

%o for k in count(max(startvalue,2)):

%o if all(map(lambda d: d[0] % 4 != 3 or d[1] % 2 == 0, factorint(k**2-1).items())):

%o yield k

%o A050795_list = list(islice(A050795_gen(),20)) # _Chai Wah Wu_, Mar 07 2022

%o (PARI) select( {is_A050795(n)=#qfbsolve(Qfb(1,0,1),n^2-1,2)}, [1..999]) \\ _M. F. Hasler_, Mar 07 2022

%Y Cf. A050796, A050797, A001541, A001542, A001333.

%Y Cf. A140612, A002378.

%K nonn

%O 1,1

%A _Patrick De Geest_, Sep 15 1999

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 16 14:51 EDT 2024. Contains 371749 sequences. (Running on oeis4.)