login
a(n) = 9^(3*n + 2).
1

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

%S 81,59049,43046721,31381059609,22876792454961,16677181699666569,

%T 12157665459056928801,8862938119652501095929,

%U 6461081889226673298932241,4710128697246244834921603689,3433683820292512484657849089281

%N a(n) = 9^(3*n + 2).

%H Vincenzo Librandi, <a href="/A013745/b013745.txt">Table of n, a(n) for n = 0..200</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 (729).

%F From _Philippe Deléham_, Nov 30 2008: (Start)

%F a(n) = 729*a(n-1); a(0)=81.

%F G.f.: 81/(1-729*x). (End)

%t 9^(3Range[0,20]+2) (* _Harvey P. Dale_, Mar 30 2011 *)

%o (Magma) [9^(3*n+2): n in [0..15]]; // _Vincenzo Librandi_, Jun 26 2011

%o (PARI) a(n)=9^(3*n+2) \\ _Charles R Greathouse IV_, Jul 10 2016

%Y Subsequence of A001019 (9^n).

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_