cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A005029 #42 Aug 16 2024 19:03:52
%S A005029 13,26,52,104,208,416,832,1664,3328,6656,13312,26624,53248,106496,
%T A005029 212992,425984,851968,1703936,3407872,6815744,13631488,27262976,
%U A005029 54525952,109051904,218103808,436207616,872415232,1744830464,3489660928,6979321856,13958643712
%N A005029 a(n) = 13*2^n.
%C A005029 The first differences are the sequence itself. - _Alexandre Wajnberg_ & _Eric Angelini_, Sep 07 2005
%C A005029 13 times powers of 2. - _Omar E. Pol_, Dec 16 2008
%H A005029 Vincenzo Librandi, <a href="/A005029/b005029.txt">Table of n, a(n) for n = 0..1000</a>
%H A005029 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A005029 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (2).
%F A005029 a(n) = 2*a(n-1), n>0; a(0)=13. G.f.: 13/(1-2*x). - _Philippe Deléham_, Nov 23 2008
%F A005029 a(n) = A000079(n)*13. - _Omar E. Pol_, Dec 16 2008
%F A005029 E.g.f.: 13*exp(2*x). - _Elmo R. Oliveira_, Aug 16 2024
%t A005029 13*2^Range[0, 60] (* _Vladimir Joseph Stephan Orlovsky_, Jun 09 2011 *)
%t A005029 NestList[2#&,13,30] (* _Harvey P. Dale_, Oct 20 2012 *)
%t A005029 CoefficientList[Series[13 / (1 - 2 x), {x, 0, 50}], x] (* _Vincenzo Librandi_, Jun 08 2013 *)
%o A005029 (Magma) [13*2^n: n in [0..30]]; // _Vincenzo Librandi_, Jun 08 2013
%o A005029 (PARI) a(n)=13<<n \\ _Charles R Greathouse IV_, Oct 07 2015
%Y A005029 Cf. A000079. - _Omar E. Pol_, Dec 16 2008
%K A005029 nonn,easy
%O A005029 0,1
%A A005029 _N. J. A. Sloane_