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 A167585 #14 Jun 17 2017 04:38:04
%S A167585 13,41,93,169,269,393,541,713,909,1129,1373,1641,1933,2249,2589,2953,
%T A167585 3341,3753,4189,4649,5133,5641,6173,6729,7309,7913,8541,9193,9869,
%U A167585 10569,11293,12041,12813,13609,14429,15273,16141,17033,17949,18889
%N A167585 a(n) = 12*n^2 - 8*n + 9.
%C A167585 The third row of the ED4 array A167584.
%H A167585 G. C. Greubel, <a href="/A167585/b167585.txt">Table of n, a(n) for n = 1..1000</a>
%H A167585 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).
%F A167585 GF(z) = (9*z^2 + 2*z + 13)/(1-z)^3.
%F A167585 a(n) = a(n-1) + 24*n - 20, with a(1)=13. - _Vincenzo Librandi_, Dec 03 2010
%F A167585 a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - _G. C. Greubel_, Jun 17 2016
%t A167585 LinearRecurrence[{3, -3, 1}, {13, 41, 93}, 100] (* _G. C. Greubel_, Jun 17 2016 *)
%o A167585 (PARI) a(n)=12*n^2-8*n+9 \\ _Charles R Greathouse IV_, Jun 17 2017
%K A167585 easy,nonn
%O A167585 1,1
%A A167585 _Johannes W. Meijer_, Nov 10 2009