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

%I #22 Sep 08 2022 08:44:38

%S 13,2197,371293,62748517,10604499373,1792160394037,302875106592253,

%T 51185893014090757,8650415919381337933,1461920290375446110677,

%U 247064529073450392704413,41753905413413116367045797

%N a(n) = 13^(2*n + 1).

%H Vincenzo Librandi, <a href="/A013718/b013718.txt">Table of n, a(n) for n = 0..200</a>

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>

%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (169).

%F From _Philippe Deléham_, Nov 25 2008: (Start)

%F a(n) = 169*a(n-1); a(0)=13.

%F G.f.: 13/(1-169*x). (End)

%p seq(13^(2*n+1),n=0..11); # _Nathaniel Johnston_, Jun 25 2011

%o (Magma) [13^(2*n+1): n in [0..15]]; // _Vincenzo Librandi_, Jun 26 2011

%o (PARI) a(n)=13^(2*n+1) \\ _Charles R Greathouse IV_, Jul 11 2016

%Y Bisection of A001022 (12^n).

%Y Cf. A013708-A013717, A013719-A013729.

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_

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 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)