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 A017099 #20 Jan 20 2024 16:32:28
%S A017099 2048,100000000000,64268410079232,3670344486987776,70188843638032384,
%T A017099 717368321110468608,4882812500000000000,24986644000165537792,
%U A017099 103510234140112521216,364375289404334925824,1127073856954876807168,3138105960900000000000,8007313507497959524352
%N A017099 a(n) = (8*n + 2)^11.
%H A017099 Vincenzo Librandi, <a href="/A017099/b017099.txt">Table of n, a(n) for n = 0..10000</a>
%H A017099 <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 A017099 From _Amiram Eldar_, Apr 24 2023: (Start)
%F A017099 a(n) = A017089(n)^11.
%F A017099 a(n) = 2^11*A016823(n).
%F A017099 Sum_{n>=0} 1/a(n) = 50521*Pi^11/60881161420800 + 2047*zeta(11)/8388608. (End)
%F A017099 a(n) = 12*a(n-1) - 66*a(n-2) + 220*a(n-3) - 495*a(n-4) + 792*a(n-5) - 924*a(n-6) + 792*a(n-7) - 495*a(n-8) + 220*a(n-9) - 66*a(n-10) + 12*a(n-11) - a(n-12). - _Wesley Ivan Hurt_, Jan 20 2024
%t A017099 (8*Range[0,20]+2)^11 (* _Harvey P. Dale_, Dec 12 2012 *)
%o A017099 (Magma) [(8*n+2)^11: n in [0..20]]; // _Vincenzo Librandi_, Jul 12 2011
%Y A017099 Cf. A013669, A016823, A017089.
%K A017099 nonn,easy
%O A017099 0,1
%A A017099 _N. J. A. Sloane_