|
%I #32 Sep 08 2022 08:44:38
%S 16,65536,268435456,1099511627776,4503599627370496,
%T 18446744073709551616,75557863725914323419136,
%U 309485009821345068724781056,1267650600228229401496703205376,5192296858534827628530496329220096
%N a(n) = 16^(3n+1).
%H Vincenzo Librandi, <a href="/A013758/b013758.txt">Table of n, a(n) for n = 0..100</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 (4096).
%F From _Philippe Deléham_, Dec 03 2008: (Start)
%F a(n) = 4096*a(n-1), n>0; a(0)=16.
%F G.f.: 16/(1-4096*x).
%F a(n) = 2*A013788(n). (End)
%t lst={};Do[AppendTo[lst,16^(3*n+1)],{n,0,4!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Mar 02 2009 *)
%t 16^(3Range[0,20]+1) (* or *) NestList[4096#&,16,20] (* _Harvey P. Dale_, Aug 14 2021 *)
%o (Magma) [16^(3*n+1): n in [0..15]]; // _Vincenzo Librandi_, May 24 2011
%o (PARI) a(n)=16<<(12*n) \\ _Charles R Greathouse IV_, May 24 2011
%Y Cf. A013788.
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_
| 