login
a(n) = 15^(5*n + 2).
1

%I #15 Sep 08 2022 08:44:38

%S 225,170859375,129746337890625,98526125335693359375,

%T 74818276426792144775390625,56815128661595284938812255859375,

%U 43143988327398919500410556793212890625,32762466136118554495624266564846038818359375,24878997722115027320114677422679960727691650390625

%N a(n) = 15^(5*n + 2).

%H Vincenzo Librandi, <a href="/A013875/b013875.txt">Table of n, a(n) for n = 0..100</a>

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>

%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (759375).

%F a(n) = 759375*a(n-1). - _Harvey P. Dale_, Mar 18 2016

%t 15^(5*Range[0,10]+2) (* or *) NestList[759375#&,225,10] (* _Harvey P. Dale_, Mar 18 2016 *)

%o (Magma) [15^(5*n+2): n in [0..10]]; // _Vincenzo Librandi_, Jul 10 2011

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_