|
%I #25 Sep 08 2022 08:44:38
%S 16,16384,16777216,17179869184,17592186044416,18014398509481984,
%T 18446744073709551616,18889465931478580854784,
%U 19342813113834066795298816,19807040628566084398385987584,20282409603651670423947251286016
%N a(n) = 4^(5n+2).
%H Vincenzo Librandi, <a href="/A013831/b013831.txt">Table of n, a(n) for n = 0..70</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 (1024).
%F a(n) = 1024*a(n-1), n>0; a(0)=16. G.f.: 16/(1-1024*x). a(n) = 4*A013830(n). - _Philippe Deléham_, Nov 30 2008
%t lst={};Do[AppendTo[lst,4^(5*n+2)],{n,0,4!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Mar 02 2009 *)
%t 4^(5*Range[0,20]+2) (* or *) NestList[1024#&,16,20] (* _Harvey P. Dale_, Apr 02 2018 *)
%o (Magma) [4^(5*n+2): n in [0..40]]; // _Vincenzo Librandi_, Apr 25 2011
%o (PARI) a(n)=4^(5*n+2) \\ _Charles R Greathouse IV_, Jan 19 2012
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_
|
