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 A013757 #30 Sep 08 2022 08:44:38 %S A013757 225,759375,2562890625,8649755859375,29192926025390625, %T A013757 98526125335693359375,332525673007965087890625, %U A013757 1122274146401882171630859375,3787675244106352329254150390625,12783403948858939111232757568359375 %N A013757 a(n) = 15^(3*n + 2). %H A013757 Vincenzo Librandi, <a href="/A013757/b013757.txt">Table of n, a(n) for n = 0..200</a> %H A013757 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a> %H A013757 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (3375). %F A013757 From _Philippe Deléham_, Dec 03 2008: (Start) %F A013757 a(n) = 3375*a(n-1); a(0)=225. %F A013757 G.f.: 225/(1-3375*x). (End) %t A013757 15^(3Range[0,20]+2) (* or *) NestList[3375#&,225,20] (* _Harvey P. Dale_, Oct 25 2011 *) %o A013757 (Magma) [15^(3*n+2): n in [0..15]]; // _Vincenzo Librandi_, Jun 27 2011 %o A013757 (Maxima) makelist(15^(3*n+2),n,0,20); /* _Martin Ettl_, Oct 21 2012 */ %o A013757 (PARI) a(n)=15^(3*n+2) \\ _Charles R Greathouse IV_, Jul 10 2016 %Y A013757 Subsequence of A001024. %K A013757 nonn,easy %O A013757 0,1 %A A013757 _N. J. A. Sloane_