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 A016955 #18 Mar 30 2022 06:34:48
%S A016955 177147,31381059609,8649755859375,350277500542221,5559060566555523,
%T A016955 50542106513726817,317475837322472439,1532278301220703125,
%U A016955 6071163615208263051,20635899893042801193,62050608388552823487,168787390185178426269,422351360321044921875,984770902183611232881
%N A016955 a(n) = (6*n + 3)^11.
%H A016955 Vincenzo Librandi, <a href="/A016955/b016955.txt">Table of n, a(n) for n = 0..2000</a>
%H A016955 <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 A016955 From _Amiram Eldar_, Mar 30 2022: (Start)
%F A016955 a(n) = A016945(n)^11.
%F A016955 a(n) = 3^11*A016763(n).
%F A016955 Sum_{n>=0} 1/a(n) = 2047*zeta(11)/362797056.
%F A016955 Sum_{n>=0} (-1)^n/a(n) = 50521*Pi^11/2633035913625600. (End)
%t A016955 a[n_] := (6*n + 3)^11; Array[a, 50, 0] (* _Amiram Eldar_, Mar 30 2022 *)
%o A016955 (Magma) [(6*n+3)^11: n in [0..20]]; // _Vincenzo Librandi_, May 06 2011
%Y A016955 Cf. A016763, A016945, A016946, A016947, A016948, A016949, A016950, A016951, A016952, A016953, A016954.
%Y A016955 Subsequence of A008455.
%K A016955 nonn,easy
%O A016955 0,1
%A A016955 _N. J. A. Sloane_