|
%I #37 Jan 05 2023 03:11:52
%S 17,34,68,136,272,544,1088,2176,4352,8704,17408,34816,69632,139264,
%T 278528,557056,1114112,2228224,4456448,8912896,17825792,35651584,
%U 71303168,142606336,285212672,570425344,1140850688,2281701376,4563402752,9126805504,18253611008
%N a(n) = 17*2^n.
%C The first differences are the sequence itself. Doubling the terms gives the same sequence (beginning one step further).
%C 17 times powers of 2. - _Omar E. Pol_, Dec 17 2008
%H Vincenzo Librandi, <a href="/A110287/b110287.txt">Table of n, a(n) for n = 0..235</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 (2).
%F G.f.: 17/(1-2*x). - _Philippe Deléham_, Nov 23 2008
%F a(n) = 17*A000079(n). - _Omar E. Pol_, Dec 17 2008
%F a(n) = 2*a(n-1) (with a(0)=17). - _Vincenzo Librandi_, Dec 26 2010
%F a(n) = A173786(n+4, n) for n>3. - _Reinhard Zumkeller_, Feb 28 2010
%F E.g.f.: 17*exp(2*x). - _G. C. Greubel_, Jan 05 2023
%t 17*2^Range[0, 60] (* _Vladimir Joseph Stephan Orlovsky_, Jun 09 2011 *)
%t NestList[2#&,17,30] (* _Harvey P. Dale_, Jul 21 2014 *)
%o (Magma) [17*2^n: n in [0..40]]; // _Vincenzo Librandi_, Apr 28 2011
%o (PARI) a(n)=17*2^n \\ _Charles R Greathouse IV_, Oct 07 2015
%o (SageMath) [17*2^n for n in range(51)] # _G. C. Greubel_, Jan 05 2023
%Y Sequences of the form (2*m+1)*2^n: A000079 (m=0), A003945 (m=1), A020714 (m=2), A005009 (m=3), A005010 (m=4), A005015 (m=5), A005029 (m=6), A110286 (m=7), this sequence (m=8), A110288 (m=9), A175805 (m=10), A248646 (m=11), A164161 (m=12), A175806 (m=13), A257548 (m=15).
%Y Cf. A007283.
%K easy,nonn
%O 0,1
%A _Alexandre Wajnberg_, Sep 07 2005
%E Edited by _Omar E. Pol_, Dec 16 2008
|
