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 A016760 #36 Sep 08 2022 08:44:41
%S A016760 1,6561,390625,5764801,43046721,214358881,815730721,2562890625,
%T A016760 6975757441,16983563041,37822859361,78310985281,152587890625,
%U A016760 282429536481,500246412961,852891037441,1406408618241,2251875390625,3512479453921,5352009260481,7984925229121,11688200277601
%N A016760 a(n) = (2*n+1)^8.
%H A016760 Vincenzo Librandi, <a href="/A016760/b016760.txt">Table of n, a(n) for n = 0..10000</a>
%H A016760 <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (9,-36,84,-126,126,-84,36,-9,1).
%F A016760 a(n) = A016756(n)^2. - _Michel Marcus_, Dec 26 2016
%F A016760 G.f.: -(1+6552*x +331612*x^2 +2485288*x^3 +4675014*x^4 +2485288*x^5 +331612*x^6 +6552*x^7 +x^8)/(x-1)^9 . - _R. J. Mathar_, Jul 07 2017
%F A016760 Sum_{n>=0} 1/a(n) = 17*Pi^8/161280 (A300710). - _Amiram Eldar_, Oct 11 2020
%F A016760 Product_{n>=1} (1 - 1/a(n)) = Pi*cosh(Pi/2)*(cos(Pi/sqrt(2)) + cosh(Pi/sqrt(2)))/32. - _Amiram Eldar_, Jan 28 2021
%t A016760 Table[(2*n+1)^8, {n,0,30}] (* _G. C. Greubel_, Sep 15 2018 *)
%o A016760 (Magma) [(2*n+1)^8: n in [0..30]]; // _Vincenzo Librandi_, Sep 07 2011
%o A016760 (Maxima) A016760(n):=(2*n+1)^8$
%o A016760 makelist(A016760(n),n,0,20); /* _Martin Ettl_, Nov 12 2012 */
%o A016760 (PARI) vector(30, n, n--; (2*n+1)^8) \\ _G. C. Greubel_, Sep 15 2018
%Y A016760 Cf. A016756, A300710.
%K A016760 nonn,easy
%O A016760 0,2
%A A016760 _N. J. A. Sloane_