login
a(n) = 16^(3n + 2).
2

%I #21 Dec 04 2023 13:48:58

%S 256,1048576,4294967296,17592186044416,72057594037927936,

%T 295147905179352825856,1208925819614629174706176,

%U 4951760157141521099596496896

%N a(n) = 16^(3n + 2).

%H Vincenzo Librandi, <a href="/A013759/b013759.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), a(0)=256.

%F G.f.: 256/(1-4096*x).

%F a(n) = 16*A013758(n). (End)

%t 16^(3*Range[0,10]+2) (* or *) NestList[4096#&,256,10] (* _Harvey P. Dale_, Dec 04 2023 *)

%o (Magma) [16^(3*n+2): n in [0..15]]; // _Vincenzo Librandi_, May 24 2011

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

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_