This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A013745 a(n) = 9^(3*n + 2). 1
 81, 59049, 43046721, 31381059609, 22876792454961, 16677181699666569, 12157665459056928801, 8862938119652501095929, 6461081889226673298932241, 4710128697246244834921603689, 3433683820292512484657849089281 (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 (729). FORMULA From Philippe Deléham, Nov 30 2008: (Start) a(n) = 729*a(n-1); a(0)=81. G.f.: 81/(1-729*x). (End) MATHEMATICA 9^(3Range[0, 20]+2)  (* Harvey P. Dale, Mar 30 2011 *) PROG (MAGMA) [9^(3*n+2): n in [0..15]]; // Vincenzo Librandi, Jun 26 2011 (PARI) a(n)=9^(3*n+2) \\ Charles R Greathouse IV, Jul 10 2016 CROSSREFS Subsequence of A001019 (9^n). Sequence in context: A017560 A128493 A145261 * A093227 A187751 A285997 Adjacent sequences:  A013742 A013743 A013744 * A013746 A013747 A013748 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 January 24 03:59 EST 2019. Contains 319412 sequences. (Running on oeis4.)