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 A013755 #27 Sep 08 2022 08:44:38 %S A013755 196,537824,1475789056,4049565169664,11112006825558016, %T A013755 30491346729331195904,83668255425284801560576, %U A013755 229585692886981495482220544,629983141281877223603213172736,1728673739677471101567216945987584,4743480741674980702700443299789930496 %N A013755 a(n) = 14^(3*n + 2). %H A013755 Vincenzo Librandi, <a href="/A013755/b013755.txt">Table of n, a(n) for n = 0..200</a> %H A013755 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a> %H A013755 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (2744). %e A013755 From _Philippe Deléham_, Dec 02 2008: (Start) %e A013755 a(n) = 2744*a(n-1); a(0)=196. %e A013755 G.f.: 196/(1-2744*x). %e A013755 a(n) = 14*A013754(n). (End) %t A013755 14^(3*Range[0,10]+2) (* or *) NestList[2744#&,196,10] (* _Harvey P. Dale_, Jan 12 2016 *) %o A013755 (Magma) [14^(3*n+2): n in [0..15]]; // _Vincenzo Librandi_, Jun 27 2011 %o A013755 (PARI) a(n)=14^(3*n+2) \\ _Charles R Greathouse IV_, Jun 27 2011 %Y A013755 Subsequence of A001023. %K A013755 nonn,easy %O A013755 0,1 %A A013755 _N. J. A. Sloane_