%I #25 Sep 08 2022 08:44:38

%S 64,65536,67108864,68719476736,70368744177664,72057594037927936,

%T 73786976294838206464,75557863725914323419136,

%U 77371252455336267181195264,79228162514264337593543950336,81129638414606681695789005144064

%N a(n) = 4^(5*n + 3).

%H Vincenzo Librandi, <a href="/A013832/b013832.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 (1024).

%F From _Philippe Deléham_, Nov 30 2008: (Start)

%F a(n) = 1024*a(n-1); a(0)=64.

%F G.f.: 64/(1-1024*x).

%F a(n) = 4*A013831(n). (End)

%t 4^(5*Range[0,20]+3) (* or *) NestList[1024#&,64,20] (* _Harvey P. Dale_, May 28 2013 *)

%o (Magma) [4^(5*n+3): n in [0..15]]; // _Vincenzo Librandi_, Jul 07 2011

%o (Maxima) makelist(4^(5*n+3),n,0,20); /* _Martin Ettl_, Oct 21 2012 */

%o (PARI) a(n)=4^(5*n+3) \\ _Charles R Greathouse IV_, Jul 11 2016

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_