A005029 a(n) = 13*2^n.

13, 26, 52, 104, 208, 416, 832, 1664, 3328, 6656, 13312, 26624, 53248, 106496, 212992, 425984, 851968, 1703936, 3407872, 6815744, 13631488, 27262976, 54525952, 109051904, 218103808, 436207616, 872415232, 1744830464, 3489660928, 6979321856, 13958643712

Offset

0,1

Comments

The first differences are the sequence itself. - Alexandre Wajnberg & Eric Angelini, Sep 07 2005

13 times powers of 2. - Omar E. Pol, Dec 16 2008

Links

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

Tanya Khovanova, Recursive Sequences

Index entries for linear recurrences with constant coefficients, signature (2).

Formula

a(n) = 2*a(n-1), n>0; a(0)=13. G.f.: 13/(1-2*x). - Philippe Deléham, Nov 23 2008

a(n) = A000079(n)*13. - Omar E. Pol, Dec 16 2008

E.g.f.: 13*exp(2*x). - Elmo R. Oliveira, Aug 16 2024

Mathematica

13*2^Range[0, 60] (* Vladimir Joseph Stephan Orlovsky, Jun 09 2011 *)
NestList[2#&, 13, 30] (* Harvey P. Dale, Oct 20 2012 *)
CoefficientList[Series[13 / (1 - 2 x), {x, 0, 50}], x] (* Vincenzo Librandi, Jun 08 2013 *)

Prog

(Magma) [13*2^n: n in [0..30]]; // Vincenzo Librandi, Jun 08 2013
(PARI) a(n)=13<<n \\ Charles R Greathouse IV, Oct 07 2015

Crossrefs

Cf. A000079. - Omar E. Pol, Dec 16 2008

Sequence in context: A019551 A098961 A033897 * A251149 A293787 A041330

Adjacent sequences: A005026 A005027 A005028 * A005030 A005031 A005032

Keyword

nonn,easy

Author

N. J. A. Sloane

Status

approved