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 A100041 #12 Mar 25 2021 13:04:41
%S A100041 -7,-4,3,14,29,48,71,98,129,164,203,246,293,344,399,458,521,588,659,
%T A100041 734,813,896,983,1074,1169,1268,1371,1478,1589,1704,1823,1946,2073,
%U A100041 2204,2339,2478,2621,2768,2919,3074,3233,3396,3563,3734,3909,4088,4271,4458,4649
%N A100041 a(n) = 2*n^2 + n - 7.
%H A100041 G. C. Greubel, <a href="/A100041/b100041.txt">Table of n, a(n) for n = 0..5000</a>
%H A100041 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).
%F A100041 A100035(a(n)) = 5 for n>3.
%F A100041 a(n) = A014105(n) - 7 = A084849(n) - 8 = A100040(n) - 2.
%F A100041 From _G. C. Greubel_, Jul 15 2017: (Start)
%F A100041 G.f.: (7 - 17 x + 6 x^2)/(-1 + x)^3.
%F A100041 E.g.f.: (2*x^2 + 3*x - 7)*exp(x). (End)
%t A100041 Table[2*n^2 + n - 7, {n, 0, 50}] (* _G. C. Greubel_, Jul 15 2017 *)
%t A100041 LinearRecurrence[{3,-3,1},{-7,-4,3},50] (* _Harvey P. Dale_, Mar 25 2021 *)
%o A100041 (PARI) a(n)=2*n^2+n-7 \\ _Charles R Greathouse IV_, Jun 17 2017
%Y A100041 Cf. A100036, A100037, A100038, A100039.
%K A100041 sign,easy
%O A100041 0,1
%A A100041 _Reinhard Zumkeller_, Oct 31 2004