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 A016931 #18 Mar 28 2022 07:40:34
%S A016931 1,1977326743,1792160394037,116490258898219,2384185791015625,
%T A016931 25408476896404831,177917621779460413,929293739471222707,
%U A016931 3909821048582988049,13931233916552734375,43513917611435838661,122130132904968017083,313726685568359708377,747993810527520928879
%N A016931 a(n) = (6*n + 1)^11.
%H A016931 Vincenzo Librandi, <a href="/A016931/b016931.txt">Table of n, a(n) for n = 0..1000</a>
%H A016931 <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 A016931 From _Amiram Eldar_, Mar 28 2022: (Start)
%F A016931 a(n) = A016921(n)^11.
%F A016931 Sum_{n>=0} 1/a(n) = 1261501*Pi^11/(428554022400*sqrt(3)) + 181308931*zeta(11)/362797056. (End)
%t A016931 (6*Range[0,20]+1)^11 (* _Harvey P. Dale_, Aug 23 2017 *)
%o A016931 (Magma) [(6*n+1)^11: n in [0..25]]; // _Vincenzo Librandi_, May 04 2011
%Y A016931 Cf. A016921, A016922, A016923, A016924, A016925, A016926, A016927, A016928, A016929, A016930.
%K A016931 nonn,easy
%O A016931 0,2
%A A016931 _N. J. A. Sloane_