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 A013735 #37 Sep 08 2022 08:44:38
%S A013735 16,1024,65536,4194304,268435456,17179869184,1099511627776,
%T A013735 70368744177664,4503599627370496,288230376151711744,
%U A013735 18446744073709551616,1180591620717411303424,75557863725914323419136,4835703278458516698824704
%N A013735 a(n) = 4^(3*n+2).
%C A013735 Additive digital root of a(n) = 7. - _Miquel Cerda_, Jul 03 2016
%H A013735 Vincenzo Librandi, <a href="/A013735/b013735.txt">Table of n, a(n) for n = 0..100</a>
%H A013735 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A013735 <a href="/index/Di#divseq">Index to divisibility sequences</a>
%H A013735 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (64).
%F A013735 G.f.: 16/(1-64*x). - _Philippe Deléham_, Nov 24 2008
%F A013735 From _Ilya Gutkovskiy_, Jul 03 2016: (Start)
%F A013735 E.g.f.: 16*exp(64*x).
%F A013735 a(n) = A000302(A016789(n)). (End)
%F A013735 a(n) = 64*a(n-1). - _Miquel Cerda_, Oct 28 2016
%p A013735 seq(4^(3*n+2),n=0..13); # _Nathaniel Johnston_, Jun 26 2011
%t A013735 lst={};Do[AppendTo[lst,4^(3*n+2)],{n,0,4!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Mar 02 2009 *)
%t A013735 NestList[64#&,16,20] (* _Harvey P. Dale_, Nov 04 2017 *)
%o A013735 (Magma) [4^(3*n+2): n in [0..50]]; // _Vincenzo Librandi_, Apr 25 2011
%o A013735 (PARI) 16<<(6*n) \\ _Charles R Greathouse IV_, Jan 19 2012
%Y A013735 Cf. A089357, A013734, A013713. - _Philippe Deléham_, Nov 24 2008
%K A013735 nonn,easy
%O A013735 0,1
%A A013735 _N. J. A. Sloane_