|
%I #23 Sep 08 2022 08:44:38
%S 9,59049,387420489,2541865828329,16677181699666569,
%T 109418989131512359209,717897987691852588770249,
%U 4710128697246244834921603689,30903154382632612361920641803529,202755595904452569706561330872953769
%N a(n) = 9^(4*n + 1).
%H Vincenzo Librandi, <a href="/A013790/b013790.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 (6561).
%F From _Philippe Deléham_, Dec 07 2008: (Start)
%F a(n) = 6561*a(n-1); a(0)=9.
%F G.f.: 9/(1-6561*x).
%F a(n) = A013791(n)/81. (End)
%o (Magma) [9^(4*n+1): n in [0..15]]; // _Vincenzo Librandi_, Jun 28 2011
%o (Maxima) makelist(9^(4*n+1),n,0,20); /* _Martin Ettl_, Oct 21 2012 */
%o (PARI) a(n)=9^(4*n+1) \\ _Charles R Greathouse IV_, Jul 11 2016
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_
| 