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 A013716 #24 Jun 21 2024 16:20:30 %S A013716 11,1331,161051,19487171,2357947691,285311670611,34522712143931, %T A013716 4177248169415651,505447028499293771,61159090448414546291, %U A013716 7400249944258160101211,895430243255237372246531 %N A013716 a(n) = 11^(2*n + 1). %H A013716 Vincenzo Librandi, <a href="/A013716/b013716.txt">Table of n, a(n) for n = 0..200</a> %H A013716 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a> %H A013716 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (121). %F A013716 From _Philippe Deléham_, Nov 25 2008: (Start) %F A013716 a(n) = 121*a(n-1), a(0)=11. %F A013716 G.f.: 11/(1-121*x). (End) %p A013716 seq(11^(2*n+1),n=0..11); # _Nathaniel Johnston_, Jun 25 2011 %t A013716 11^(2*Range[0,20]+1) (* or *) NestList[121#&,11,20] (* _Harvey P. Dale_, Jun 21 2024 *) %o A013716 (Magma) [11^(2*n+1): n in [0..15]]; // _Vincenzo Librandi_, Jun 26 2011 %o A013716 (PARI) a(n)=11^(2*n+1) \\ _Charles R Greathouse IV_, Jul 11 2016 %Y A013716 Bisection of A001020 (11^n). %Y A013716 Cf. A013708-A013715, A013717-A013729. %K A013716 nonn,easy %O A013716 0,1 %A A013716 _N. J. A. Sloane_