This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A005029 13*2^n. 8
 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 (list; graph; refs; listen; history; text; internal format)
 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 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<

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.