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!)
A064715 Smallest member of triple of consecutive numbers each of which is the sum of two different nonzero squares. 2

%I #21 Jul 07 2016 04:51:14

%S 232,520,584,800,808,1096,1224,1312,1600,1664,1744,1800,1872,1960,

%T 2248,2312,2384,2600,2824,3328,3392,3600,4112,4176,4328,4624,5120,

%U 5328,5408,5904,6056,6120,6352,6408,6568,6920,8080,8144,8296,8352,8584,9160,9376

%N Smallest member of triple of consecutive numbers each of which is the sum of two different nonzero squares.

%C All terms == 0 mod 8. Is this the same as A073412? - _Zak Seidov_, Jan 26 2013

%C This sequence is distinct from A073412 since it does not allow numbers equal to twice a square, like 72, 1152, 2592, 3528, etc. - _Giovanni Resta_, Jan 29 2013

%D David Wells, The Penguin Dictionary of Curious and Interesting Numbers, Revised Edition, Penguin Books Ltd., Middlesex, England, 1997, page 133. - "It is not possible to have 4 such consecutive numbers."

%H Zak Seidov, <a href="/A064715/b064715.txt">Table of n, a(n) for n = 1..1200</a>

%e 232 = 6^2 + 14^2, 233 = 8^2 + 13^2, and 234 = 3^2 + 15^2.

%t a = Table[n^2, {n, 1, 100} ]; c = {}; Do[ c = Append[c, a[[i]] + a[[j]]], {i, 1, 100}, {j, 1, i - 1} ]; c = Union[c]; c[[ Select[ Range[ Length[c] - 2], c[[ # ]] + 2 == c[[ # + 2 ]] & ]]]

%Y Cf. A004431.

%K nonn

%O 1,1

%A _Robert G. Wilson v_, Oct 13 2001

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 23 09:22 EDT 2024. Contains 371905 sequences. (Running on oeis4.)