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!)
A308395 Numbers y such that x*(x+1) + y*(y+1) = z*(z+1) is solvable in positive integers x, z with x <= y. 2

%I #96 Aug 02 2019 18:56:27

%S 2,5,6,9,10,13,14,17,18,20,21,22,24,25,26,27,29,30,33,34,35,37,38,39,

%T 41,42,44,45,46,48,49,50,51,53,54,55,56,57,58,61,62,65,66,68,69,70,73,

%U 74,75,76,77,78,80,81,82,84,85,86,89,90,91,92,93,94,95,97

%N Numbers y such that x*(x+1) + y*(y+1) = z*(z+1) is solvable in positive integers x, z with x <= y.

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

%e 14 is a term because 14*15 + 14*15 = 20*21.

%t max = 220; lst = {}; For[x = 1, x < max, x++,

%t For[y = x, y < max, y++,

%t For[z = y, z < max, z++,

%t If[x (x + 1) + y (y + 1) == z (z + 1),

%t lst = AppendTo[lst, y]]]]]; Select[Union[lst], # < max/2 &]

%o (Python)

%o from sympy import integer_nthroot

%o A308395_list, y, w = [], 1, 0

%o while len(A308395_list) < 10000:

%o w += y

%o z = 0

%o for x in range(1,y+1):

%o z += x

%o if integer_nthroot(8*(w+z)+1,2)[1]:

%o A308395_list.append(y)

%o break

%o y += 1 # _Chai Wah Wu_, Aug 02 2019

%Y Cf. A012132.

%K nonn

%O 1,1

%A _Ralf Steiner_, Jul 31 2019

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