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 A013852 #17 Sep 08 2022 08:44:38
%S A013852 729,43046721,2541865828329,150094635296999121,8862938119652501095929,
%T A013852 523347633027360537213511521,30903154382632612361920641803529,
%U A013852 1824800363140073127359051977856583921,107752636643058178097424660240453423951129
%N A013852 a(n) = 9^(5*n + 3).
%H A013852 Vincenzo Librandi, <a href="/A013852/b013852.txt">Table of n, a(n) for n = 0..100</a>
%H A013852 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A013852 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (59049).
%F A013852 a(n) = 9^A016885(n) = A001019(A016885(n)). - _Wesley Ivan Hurt_, Jan 28 2014
%p A013852 A013852:=n->9^(5*n + 3); seq(A013852(n), n=0..15); # _Wesley Ivan Hurt_, Jan 28 2014
%t A013852 Table[9^(5n + 3), {n, 0, 15}] (* _Wesley Ivan Hurt_, Jan 28 2014 *)
%o A013852 (Magma) [9^(5*n+3): n in [0..15]]; // _Vincenzo Librandi_, Jul 08 2011
%Y A013852 Cf. A001019, A016885.
%K A013852 nonn,easy
%O A013852 0,1
%A A013852 _N. J. A. Sloane_