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 A017095 #20 Apr 24 2023 02:54:31
%S A017095 128,10000000,612220032,8031810176,52523350144,230539333248,
%T A017095 781250000000,2207984167552,5455160701056,12151280273024,
%U A017095 24928547056768,47829690000000,86812553324672,150363025899136,250226879128704,402271083010688,627485170000000,953133216331392,1414067010444416
%N A017095 a(n) = (8*n + 2)^7.
%H A017095 Vincenzo Librandi, <a href="/A017095/b017095.txt">Table of n, a(n) for n = 0..10000</a>
%H A017095 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (8,-28,56,-70,56,-28,8,-1).
%F A017095 From _Amiram Eldar_, Apr 24 2023: (Start)
%F A017095 a(n) = A017089(n)^7.
%F A017095 a(n) = 2^7*A016819(n).
%F A017095 Sum_{n>=0} 1/a(n) = 61*Pi^7/47185920 + 127*zeta(7)/32768. (End)
%t A017095 Table[(8*n + 2)^7, {n, 0, 20}] (* _Amiram Eldar_, Apr 24 2023 *)
%o A017095 (Magma) [(8*n+2)^7: n in [0..30]]; // _Vincenzo Librandi_, Jul 12 2011
%Y A017095 Cf. A013665, A016819, A017089 (8n+2), A001015 (n^7).
%K A017095 nonn,easy
%O A017095 0,1
%A A017095 _N. J. A. Sloane_