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 A016768 #24 Sep 08 2022 08:44:41 %S A016768 0,81,1296,6561,20736,50625,104976,194481,331776,531441,810000, %T A016768 1185921,1679616,2313441,3111696,4100625,5308416,6765201,8503056, %U A016768 10556001,12960000,15752961,18974736,22667121,26873856,31640625,37015056,43046721,49787136,57289761 %N A016768 (3*n)^4. %H A016768 Vincenzo Librandi, <a href="/A016768/b016768.txt">Table of n, a(n) for n = 0..10000</a> %H A016768 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (5,-10,10,-5,1). %F A016768 a(n) = A000583(3n) = 81*A000583(n) = A008585(n)^4. - _Wesley Ivan Hurt_, May 10 2014 %F A016768 G.f.: -81*x*(1+x)*(x^2+10*x+1) / (x-1)^5. - _R. J. Mathar_, May 14 2014 %p A016768 A016768:=n->(3*n)^4; seq(A016768(n), n=0..40); # _Wesley Ivan Hurt_, May 10 2014 %t A016768 (3Range[0,30])^4 (* _Harvey P. Dale_, Sep 19 2011 *) %o A016768 (Magma) [(3*n)^4: n in [0..40]]; // _Vincenzo Librandi_, Sep 07 2011 %K A016768 nonn,easy %O A016768 0,2 %A A016768 _N. J. A. Sloane_, Dec 11 1996