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 A013795 #23 Sep 08 2022 08:44:38
%S A013795 1331,19487171,285311670611,4177248169415651,61159090448414546291,
%T A013795 895430243255237372246531,13109994191499930367061460371,
%U A013795 191943424957750480504146841291811,2810243684806424785061213903353404851
%N A013795 a(n) = 11^(4*n+3).
%H A013795 Vincenzo Librandi, <a href="/A013795/b013795.txt">Table of n, a(n) for n = 0..200</a>
%H A013795 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A013795 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (14641).
%F A013795 a(n) = 14641*a(n-1). - _Harvey P. Dale_, May 26 2016
%F A013795 G.f.: 1331/(1 - 14641x). - _Indranil Ghosh_, Apr 09 2017
%p A013795 A013795:=n->11^(4*n+3): seq(A013795(n), n=0..10); # _Wesley Ivan Hurt_, Apr 08 2017
%t A013795 11^(4*Range[0,10]+3) (* or *) NestList[14641#&,1331,10] (* _Harvey P. Dale_, May 26 2016 *)
%t A013795 CoefficientList[Series[1331/(1- 14641x), {x, 0, 10}], x] (* _Indranil Ghosh_, Apr 09 2017 *)
%o A013795 (Magma) [11^(4*n+3): n in [0..10]]; // _Vincenzo Librandi_, Jun 28 2011
%o A013795 (PARI) a(n) = 11^(4*n + 3) \\ _Indranil Ghosh_, Apr 09 2017
%o A013795 (Python) def a(n): return 11**(4*n + 3) # _Indranil Ghosh_, Apr 09 2017
%Y A013795 Subsequence of A001020. - _Michel Marcus_, Apr 08 2017
%K A013795 nonn,easy
%O A013795 0,1
%A A013795 _N. J. A. Sloane_