login
a(n) = 2^(5*n + 4).
2

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

%S 16,512,16384,524288,16777216,536870912,17179869184,549755813888,

%T 17592186044416,562949953421312,18014398509481984,576460752303423488,

%U 18446744073709551616,590295810358705651712,18889465931478580854784

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

%H Vincenzo Librandi, <a href="/A013825/b013825.txt">Table of n, a(n) for n = 0..200</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 (32).

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

%F a(n) = 32*a(n-1), n > 0; a(0)=16.

%F G.f.: 16/(1-32*x).

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

%t 2^(5*Range[0, 20] + 4) (* or *) NestList[32#&,16,20] (* _Harvey P. Dale_, Sep 27 2015 *)

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

%Y Cf. A000079 (2^n), A016897 (5*n+4).

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_