This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A158420 #19 May 21 2025 18:34:27
%S A158420 1022,4092,9210,16376,25590,36852,50162,65520,82926,102380,123882,
%T A158420 147432,173030,200676,230370,262112,295902,331740,369626,409560,
%U A158420 451542,495572,541650,589776,639950,692172,746442,802760,861126,921540,984002
%N A158420 a(n) = 1024*n^2 - 2*n.
%C A158420 The identity (1024*n-1)^2-(1024*n^2-2*n)*(32)^2=1 can be written as A158421(n)^2-a(n)*(32)^2=1.
%H A158420 Vincenzo Librandi, <a href="/A158420/b158420.txt">Table of n, a(n) for n = 1..10000</a>
%H A158420 Vincenzo Librandi, <a href="http://mathforum.org/kb/message.jspa?messageID=5785989&tstart=0">X^2-AY^2=1</a>
%H A158420 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 15 in the first table at p. 85, case d(t) = t*(32^2*t-2)).
%H A158420 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).
%F A158420 a(n) = 3*a(n-1) -3*a(n-2) +a(n-3).
%F A158420 G.f.: x*(-1022-1026*x)/(x-1)^3.
%t A158420 LinearRecurrence[{3,-3,1},{1022,4092,9210},50]
%o A158420 (Magma) I:=[1022, 4092, 9210]; [n le 3 select I[n] else 3*Self(n-1)-3*Self(n-2)+1*Self(n-3): n in [1..50]];
%o A158420 (PARI) a(n) = 1024*n^2 - 2*n
%Y A158420 Cf. A158421.
%K A158420 nonn,easy
%O A158420 1,1
%A A158420 _Vincenzo Librandi_, Mar 18 2009