login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076673 Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=7. 1
7, 24, 32, 60, 63, 84, 112, 180, 189, 252, 275, 660, 693, 924, 1232, 1326, 1768, 1974, 2632, 4026, 5368, 6405, 8200, 8319, 11092, 11715, 15620, 16401, 19720, 20706, 20880, 20910, 24752, 24960, 25300, 26565, 29716, 29835, 33048, 35055, 41496 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

The sequence is infinite.

LINKS

Table of n, a(n) for n=1..41.

MATHEMATICA

nxt[n_]:= Module[{k = n + 1}, While[!IntegerQ[Sqrt[n^2 + k^2]], k++]; k]; NestList[nxt, 7, 40] (* Harvey P. Dale, May 29 2015 *)

CROSSREFS

Cf. A076600.

Sequence in context: A070410 A077035 A076602 * A270422 A063165 A154612

Adjacent sequences:  A076670 A076671 A076672 * A076674 A076675 A076676

KEYWORD

nonn

AUTHOR

Zak Seidov, Oct 25 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 3 14:15 EST 2016. Contains 278745 sequences.