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 A079588 #33 Aug 01 2022 10:54:46
%S A079588 1,30,135,364,765,1386,2275,3480,5049,7030,9471,12420,15925,20034,
%T A079588 24795,30256,36465,43470,51319,60060,69741,80410,92115,104904,118825,
%U A079588 133926,150255,167860,186789,207090,228811,252000,276705,302974,330855,360396,391645
%N A079588 a(n) = (n+1)*(2*n+1)*(4*n+1).
%C A079588 Apart from offset, same as A100147.
%D A079588 R. Tijdeman, Some applications of Diophantine approximation, pp. 261-284 of Surveys in Number Theory (Urbana, May 21, 2000), ed. M. A. Bennett et al., Peters, 2003.
%H A079588 Reinhard Zumkeller, <a href="/A079588/b079588.txt">Table of n, a(n) for n = 0..10000</a>
%H A079588 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1).
%F A079588 Sum_{n>=0} 1/a(n) = Pi/3 (cf. Tijdeman).
%F A079588 G.f.: (1+26*x+21*x^2)/(1-x)^4. - _L. Edson Jeffery_, Mar 25 2013
%F A079588 Sum_{n>=0} a(n)/2^n = 308; Sum_{n>=0} (-1)^n*a(n)/2^n = -4/3. - _L. Edson Jeffery_, Mar 25 2013
%F A079588 a(n) = 8*n^3 + 14*n^2 + 7*n + 1. - _Reinhard Zumkeller_, Jun 08 2015
%F A079588 Sum_{n>=0} (-1)^n/a(n) = log(2)/3 - Pi/2 + sqrt(2)*Pi/3 + 2*sqrt(2)*arcsin(1)/3. - _Amiram Eldar_, Jan 13 2021
%F A079588 a(n) = 4*a(n-1)-6*a(n-2)+4*a(n-3)-a(n-4). - _Wesley Ivan Hurt_, Jun 23 2021
%t A079588 Table[(n + 1)*(2*n + 1)*(4*n + 1), {n, 0, 40}] (* _Amiram Eldar_, Jan 13 2021 *)
%t A079588 LinearRecurrence[{4,-6,4,-1},{1,30,135,364},40] (* _Harvey P. Dale_, Aug 01 2022 *)
%o A079588 (Haskell)
%o A079588 a079588 n = product $ map ((+ 1) . (* n)) [1, 2, 4]
%o A079588 -- _Reinhard Zumkeller_, Jun 08 2015
%Y A079588 Cf. A100147.
%Y A079588 Cf. A258721 (first differences), A011199.
%K A079588 nonn,easy
%O A079588 0,2
%A A079588 _N. J. A. Sloane_, Jan 26 2003