|
%I #17 Jun 18 2017 02:25:48
%S 0,92,935,1299,1775,6552,8660,11424,39243,51527,67635,229772,301368,
%T 395252,1340255,1757547,2304743,7812624,10244780,13434072,45536355,
%U 59711999,78300555,265406372,348028080,456370124,1546902743,2028457347,2659921055,9016010952
%N Nonnegative values x of solutions (x, y) to the Diophantine equation x^2 + (x+433)^2 = y^2.
%H Vincenzo Librandi, <a href="/A207061/b207061.txt">Table of n, a(n) for n = 1..1000</a>
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Diophantine_equation">Diophantine equation</a>
%H MathWorld, <a href="http://mathworld.wolfram.com/DiophantineEquation.html">Diophantine equation</a>
%H <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,6,-6,0,-1,1).
%F G.f.: x^2*(76*x^5+281*x^4+76*x^3-364*x^2-843*x-92)/((x-1)*(x^6-6*x^3+1)). - _Colin Barker_, Aug 05 2012
%t LinearRecurrence[ {1, 0, 6, -6, 0, -1, 1}, {0, 92, 935, 1299, 1775, 6552, 8660}, 50]
%Y Cf. A205644, A205672, A207058, A207059, A207060.
%K nonn,easy
%O 1,2
%A _Vladimir Joseph Stephan Orlovsky_, Feb 14 2012
|
