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 A016954 #16 Mar 30 2022 06:34:45
%S A016954 59049,3486784401,576650390625,16679880978201,205891132094649,
%T A016954 1531578985264449,8140406085191601,34050628916015625,
%U A016954 119042423827613001,362033331456891249,984930291881790849,2446194060654759801,5631351470947265625,12157665459056928801
%N A016954 a(n) = (6n+3)^10.
%H A016954 Vincenzo Librandi, <a href="/A016954/b016954.txt">Table of n, a(n) for n = 0..2000</a>
%H A016954 <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (11,-55,165,-330,462,-462,330,-165,55,-11,1).
%F A016954 From _Wesley Ivan Hurt_, Aug 22 2016: (Start)
%F A016954 G.f.: 59049*(1 + 59038*x + 9116141*x^2 + 178300904*x^3 + 906923282*x^4 + 1527092468*x^5 + 906923282*x^6 + 178300904*x^7 + 9116141*x^8 + 59038*x^9 + x^10)/(1-x)^11.
%F A016954 a(n) = 11*a(n-1) - 55*a(n-2) + 165*a(n-3) - 330*a(n-4) + 462*a(n-5) - 462*a(n-6) + 330*a(n-7) - 165*a(n-8) + 55*a(n-9) - 11*a(n-10) + a(n-11) for n>10.
%F A016954 a(n) = A008454(A016945(n)). (End)
%F A016954 From _Amiram Eldar_, Mar 30 2022: (Start)
%F A016954 a(n) = A016946(n)^5 = A016949(n)^2.
%F A016954 a(n) = 3^10*A016762(n).
%F A016954 Sum_{n>=0} 1/a(n) = 31*Pi^10/171421608960. (End)
%p A016954 A016954:=n->(6*n+3)^10: seq(A016954(n), n=0..20); # _Wesley Ivan Hurt_, Aug 22 2016
%t A016954 (6 Range[0, 20] + 3)^10 (* _Wesley Ivan Hurt_, Aug 22 2016 *)
%o A016954 (Magma) [(6*n+3)^10: n in [0..20]]; // _Vincenzo Librandi_, May 06 2011
%Y A016954 Cf. A008454, A016762, A016945, A016946, A016947, A016948, A016949, A016950, A016951, A016952, A016953.
%Y A016954 Subsequence of A008454.
%K A016954 nonn,easy
%O A016954 0,1
%A A016954 _N. J. A. Sloane_