login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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
Tanya Khovanova, Recursive Sequences
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)
MATHEMATICA
9^(4*Range[0, 20]+3) (* or *) NestList[6561#&, 729, 20] (* Harvey P. Dale, Jul 30 2021 *)
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
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 10:11 EDT 2024. Contains 371935 sequences. (Running on oeis4.)