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 A146301 #18 Jan 03 2021 16:55:11
%S A146301 21,165,437,837,1365,2021,2805,3717,4757,5925,7221,8645,10197,11877,
%T A146301 13685,15621,17685,19877,22197,24645,27221,29925,32757,35717,38805,
%U A146301 42021,45365,48837,52437,56165,60021,64005,68117,72357,76725,81221
%N A146301 a(n) = (8*n+3)*(8*n+7).
%C A146301 Sum_{n>=0} 1/((8*n+3)*(8*n+7)) = (1/16)*sqrt(2)*(log(sqrt(2)-1) + Pi/2) = 0.60936936799920131042...
%H A146301 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).
%F A146301 G.f: (21 + 102*x + 5*x^2)/(1-x)^3.
%F A146301 E.g.f.: (21 + 144*x + 64*x^2)*exp(x).
%p A146301 seq((8*n+3)*(8*n+7),n=0..40);
%t A146301 Table[(8n+3)(8n+7),{n,0,40}] (* or *) LinearRecurrence[{3,-3,1},{21,165,437},40] (* _Harvey P. Dale_, Aug 16 2015 *)
%o A146301 (PARI) a(n)=(8*n+3)*(8*n+7) \\ _Charles R Greathouse IV_, Jun 17 2017
%K A146301 nonn,easy
%O A146301 0,1
%A A146301 _Miklos Kristof_, Oct 29 2008