A013790 a(n) = 9^(4*n + 1).

9, 59049, 387420489, 2541865828329, 16677181699666569, 109418989131512359209, 717897987691852588770249, 4710128697246244834921603689, 30903154382632612361920641803529, 202755595904452569706561330872953769

Offset

0,1

Links

Vincenzo Librandi, Table of n, a(n) for n = 0..200

Tanya Khovanova, Recursive Sequences

Index entries for linear recurrences with constant coefficients, signature (6561).

Formula

From Philippe Deléham, Dec 07 2008: (Start)

a(n) = 6561*a(n-1); a(0)=9.

G.f.: 9/(1-6561*x).

a(n) = A013791(n)/81. (End)

Prog

(Magma) [9^(4*n+1): n in [0..15]]; // Vincenzo Librandi, Jun 28 2011
(Maxima) makelist(9^(4*n+1), n, 0, 20); /* Martin Ettl, Oct 21 2012 */
(PARI) a(n)=9^(4*n+1) \\ Charles R Greathouse IV, Jul 11 2016

Crossrefs

Sequence in context: A159398 A321581 A053971 * A271103 A058452 A058456

Adjacent sequences: A013787 A013788 A013789 * A013791 A013792 A013793

Keyword

nonn,easy

Author

N. J. A. Sloane

Status

approved