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 A013711 #26 Aug 26 2024 17:36:34
%S A013711 6,216,7776,279936,10077696,362797056,13060694016,470184984576,
%T A013711 16926659444736,609359740010496,21936950640377856,789730223053602816,
%U A013711 28430288029929701376,1023490369077469249536,36845653286788892983296,1326443518324400147398656,47751966659678405306351616
%N A013711 a(n) = 6^(2*n+1).
%H A013711 Vincenzo Librandi, <a href="/A013711/b013711.txt">Table of n, a(n) for n = 0..200</a>
%H A013711 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A013711 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (36).
%F A013711 G.f.: 6/(1-36*x). - _Philippe Deléham_, Nov 24 2008
%F A013711 a(n) = 36*a(n-1), a(0)=6. - _Vincenzo Librandi_, May 26 2011
%F A013711 From _Elmo R. Oliveira_, Aug 26 2024: (Start)
%F A013711 E.g.f.: 6*exp(36*x).
%F A013711 a(n) = 6*A009980(n) = A004171(n)*A013708(n) = A000400(A005408(n)). (End)
%t A013711 lst={}; Do[AppendTo[lst,6^(2*n+1)],{n,0,5!}]; lst (* _Vladimir Joseph Stephan Orlovsky_, Jan 15 2009 *)
%t A013711 NestList[36#&,6,20] (* _Harvey P. Dale_, Oct 18 2012 *)
%o A013711 (Magma) [6^(2*n+1): n in [0..20]]; // _Vincenzo Librandi_, May 26 2011
%o A013711 (PARI) a(n)=6^(2*n+1) \\ _Charles R Greathouse IV_, Jul 10 2016
%Y A013711 Cf. A000400, A004171, A005408, A009980, A013708.
%K A013711 nonn,easy
%O A013711 0,1
%A A013711 _N. J. A. Sloane_