This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A013791 a(n) = 9^(4*n + 3). 2
 729, 4782969, 31381059609, 205891132094649, 1350851717672992089, 8862938119652501095929, 58149737003040059690390169, 381520424476945831628649898809, 2503155504993241601315571986085849, 16423203268260658146231467800709255289 (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)=729. G.f.: 729/(1-6561*x). a(n) = 81*A013790(n). (End) PROG (MAGMA) [9^(4*n+3): n in [0..15]]; // Vincenzo Librandi, Jun 28 2011 (PARI) a(n)=9^(4*n+3) \\ Charles R Greathouse IV, Jul 11 2016 CROSSREFS Subsequence of A001019. Sequence in context: A017022 A017106 A017202 * A017310 A017430 A017562 Adjacent sequences:  A013788 A013789 A013790 * A013792 A013793 A013794 KEYWORD nonn,easy AUTHOR 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 20 12:47 EDT 2019. Contains 328257 sequences. (Running on oeis4.)