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!)
A013714 a(n) = 9^(2*n + 1). 3
9, 729, 59049, 4782969, 387420489, 31381059609, 2541865828329, 205891132094649, 16677181699666569, 1350851717672992089, 109418989131512359209, 8862938119652501095929, 717897987691852588770249, 58149737003040059690390169 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
Tanya Khovanova, Recursive Sequences
FORMULA
From Philippe Deléham, Nov 25 2008: (Start)
a(n) = 81*a(n-1); a(0)=9.
G.f.: 9/(1-81*x). (End)
MATHEMATICA
9^(2*Range[0, 20]+1) (* or *) NestList[81#&, 9, 20] (* Harvey P. Dale, May 25 2020 *)
PROG
(Magma) [9^(2*n+1): n in [0..20]]; // Vincenzo Librandi, May 26 2011
(PARI) a(n)=9^(2*n+1) \\ Charles R Greathouse IV, Jul 11 2016
CROSSREFS
Cf. A001019.
Sequence in context: A053933 A145262 A154026 * A069034 A053847 A053854
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 23 15:20 EDT 2024. Contains 371916 sequences. (Running on oeis4.)