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 A016943 #23 Mar 30 2022 06:33:54
%S A016943 2048,8589934592,4049565169664,204800000000000,3670344486987776,
%T A016943 36028797018963968,238572050223552512,1196683881290399744,
%U A016943 4882812500000000000,16985107389382393856,52036560683837093888,143746751770690322432,364375289404334925824,858993459200000000000
%N A016943 a(n) = (6*n + 2)^11.
%H A016943 Vincenzo Librandi, <a href="/A016943/b016943.txt">Table of n, a(n) for n = 0..2000</a>
%H A016943 <a href="/index/Rec#order_12">Index entries for linear recurrences with constant coefficients</a>, signature (12,-66,220,-495,792,-924,792,-495,220,-66,12,-1).
%F A016943 a(n) = A016787(n)*2^11. - _Zerinvary Lajos_, Jun 22 2009
%F A016943 From _Amiram Eldar_, Mar 30 2022: (Start)
%F A016943 a(n) = A016933(n)^9 = A016935(n)^3.
%F A016943 Sum_{n>=0} 1/a(n) = 1847*Pi^11/(1285662067200*sqrt(3)) + 88573*zeta(11)/362797056. (End)
%t A016943 (6*Range[0,10]+2)^11 (* _Harvey P. Dale_, Sep 30 2019 *)
%o A016943 (Magma) [(6*n+2)^11: n in [0..25]]; // _Vincenzo Librandi_, May 05 2011
%Y A016943 Cf. A016787, A016933, A016934, A016935, A016936, A016937, A016938, A016939, A016940, A016941, A016942.
%Y A016943 Subsequence of A008455.
%K A016943 nonn,easy
%O A016943 0,1
%A A016943 _N. J. A. Sloane_