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 A016952 #18 Mar 30 2022 06:34:33
%S A016952 6561,43046721,2562890625,37822859361,282429536481,1406408618241,
%T A016952 5352009260481,16815125390625,45767944570401,111429157112001,
%U A016952 248155780267521,513798374428641,1001129150390625,1853020188851841,3282116715437121,5595818096650401,9227446944279201
%N A016952 a(n) = (6*n + 3)^8.
%H A016952 Vincenzo Librandi, <a href="/A016952/b016952.txt">Table of n, a(n) for n = 0..2000</a>
%H A016952 <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 A016952 From _Amiram Eldar_, Mar 30 2022: (Start)
%F A016952 a(n) = A016945(n)^8 = A016946(n)^4 = A016948(n)^2.
%F A016952 a(n) = 3^8*A016760(n).
%F A016952 Sum_{n>=0} 1/a(n) = 17*Pi^8/1058158080. (End)
%t A016952 a[n_] := (6*n + 3)^8; Array[a, 50, 0] (* _Amiram Eldar_, Mar 30 2022 *)
%o A016952 (Magma) [(6*n+3)^8: n in [0..40]]; // _Vincenzo Librandi_, May 05 2011
%Y A016952 Cf. A016760, A016945, A016946, A016947, A016948, A016949, A016950, A016951.
%Y A016952 Subsequence of A001016.
%K A016952 nonn,easy
%O A016952 0,1
%A A016952 _N. J. A. Sloane_