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 A013719 #22 Sep 08 2022 08:44:38 %S A013719 14,2744,537824,105413504,20661046784,4049565169664,793714773254144, %T A013719 155568095557812224,30491346729331195904,5976303958948914397184, %U A013719 1171355575953987221848064,229585692886981495482220544 %N A013719 a(n) = 14^(2*n + 1). %H A013719 Vincenzo Librandi, <a href="/A013719/b013719.txt">Table of n, a(n) for n = 0..200</a> %H A013719 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a> %H A013719 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (196). %F A013719 From _Philippe Deléham_, Nov 25 2008: (Start) %F A013719 a(n) = 196*a(n-1), a(0)=14. %F A013719 G.f.: 14/(1-196*x). (End) %p A013719 seq(14^(2*n+1),n=0..11); # _Nathaniel Johnston_, Jun 25 2011 %o A013719 (Magma) [14^(2*n+1): n in [0..15]]; // _Vincenzo Librandi_, Jun 26 2011 %o A013719 (PARI) a(n)=14^(2*n+1) \\ _Charles R Greathouse IV_, Jul 11 2016 %Y A013719 Bisection of A001023 (14^n). %Y A013719 Cf. A013708-A013718, A013720-A013729. %K A013719 nonn,easy %O A013719 0,1 %A A013719 _N. J. A. Sloane_