|
%I #29 Aug 19 2018 21:36:57
%S 201,401,601,801,1001,1201,1401,1601,1801,2001,2201,2401,2601,2801,
%T 3001,3201,3401,3601,3801,4001,4201,4401,4601,4801,5001,5201,5401,
%U 5601,5801,6001,6201,6401,6601,6801,7001,7201,7401,7601,7801,8001,8201,8401,8601
%N a(n) = 200*n + 1.
%C The identity (200*n + 1)^2 - (100*n^2 + n)*20^2 = 1 can be written as a(n)^2 - A055438(n)*20^2 = 1. - _Vincenzo Librandi_, Feb 04 2012
%H Vincenzo Librandi, <a href="/A157956/b157956.txt">Table of n, a(n) for n = 1..10000</a>
%H Vincenzo Librandi, <a href="http://mathforum.org/kb/message.jspa?messageID=5785989&tstart=0">X^2-AY^2=1</a>
%H E. J. Barbeau, <a href="http://www.math.toronto.edu/barbeau/home.html">Polynomial Excursions</a>, Chapter 10: <a href="http://www.math.toronto.edu/barbeau/hxpol10.pdf">Diophantine equations</a> (2010), pages 84-85 (row 14 in the first table at p. 85, case d(t) = t*(10^2*t+1)).
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F G.f.: x*(201-x)/(1-x)^2. - _Vincenzo Librandi_, Feb 04 2012
%F a(n) = 2*a(n-1) - a(n-2). - _Vincenzo Librandi_, Feb 04 2012
%t 200Range[50]+1 (* _Harvey P. Dale_, Feb 24 2011 *)
%t LinearRecurrence[{2, -1}, {201, 401}, 50] (* _Vincenzo Librandi_, Feb 04 2012 *)
%o MAGMA) I:=[201, 401]; [n le 2 select I[n] else 2*Self(n-1)-Self(n-2): n in [1..50]]; // _Vincenzo Librandi_, Feb 04 2012
%o (PARI) for(n=1, 50, print1(200*n + 1", ")); \\ _Vincenzo Librandi_, Feb 04 2012
%Y Cf. A055438.
%K nonn,easy
%O 1,1
%A _Vincenzo Librandi_, Mar 10 2009
|
