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!)
A076675 Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=10. 0

%I #8 Jun 22 2013 11:53:38

%S 10,24,32,60,63,84,112,180,189,252,275,660,693,924,1232,1326,1768,

%T 1974,2632,4026,5368,6405,8200,8319,11092,11715,15620,16401,19720,

%U 20706,20880,20910,24752,24960,25300,26565,29716,29835,33048,35055,41496

%N Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=10.

%C The sequence is infinite.

%C Apart from first term, identical to A076673. [From _R. J. Mathar_, Sep 20 2008]

%t ps[n_]:=Module[{x=n+1,n2=n^2},While[!IntegerQ[Sqrt[n2+x^2]],x++];x]; NestList[ps,10,40] (* _Harvey P. Dale_, Jun 22 2013 *)

%Y Cf. A076600.

%K nonn

%O 1,1

%A _Zak Seidov_, Oct 25 2002

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 19 18:05 EDT 2024. Contains 371798 sequences. (Running on oeis4.)