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!)
A013718 a(n) = 13^(2*n + 1). 4
13, 2197, 371293, 62748517, 10604499373, 1792160394037, 302875106592253, 51185893014090757, 8650415919381337933, 1461920290375446110677, 247064529073450392704413, 41753905413413116367045797 (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) = 169*a(n-1); a(0)=13.
G.f.: 13/(1-169*x). (End)
MAPLE
seq(13^(2*n+1), n=0..11); # Nathaniel Johnston, Jun 25 2011
PROG
(Magma) [13^(2*n+1): n in [0..15]]; // Vincenzo Librandi, Jun 26 2011
(PARI) a(n)=13^(2*n+1) \\ Charles R Greathouse IV, Jul 11 2016
CROSSREFS
Bisection of A001022 (12^n).
Sequence in context: A325216 A161588 A221927 * A145187 A221896 A209468
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 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)