login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013790 a(n) = 9^(4*n + 1). 2
9, 59049, 387420489, 2541865828329, 16677181699666569, 109418989131512359209, 717897987691852588770249, 4710128697246244834921603689, 30903154382632612361920641803529, 202755595904452569706561330872953769 (list; graph; refs; listen; history; text; internal format)
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: A198478 A159398 A053971 * A271103 A058452 A058456

Adjacent sequences:  A013787 A013788 A013789 * A013791 A013792 A013793

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 16 00:11 EST 2018. Contains 317252 sequences. (Running on oeis4.)