|
%I #19 Sep 08 2022 08:44:38
%S 256,262144,268435456,274877906944,281474976710656,288230376151711744,
%T 295147905179352825856,302231454903657293676544,
%U 309485009821345068724781056,316912650057057350374175801344,324518553658426726783156020576256
%N a(n) = 4^(5*n + 4).
%H Vincenzo Librandi, <a href="/A013833/b013833.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), n > 0; a(0)=256.
%F G.f.: 256/(1-1024*x).
%F a(n) = 4*A013832(n). (End)
%o (Magma) [4^(5*n+4): n in [0..15]]; // _Vincenzo Librandi_, Jul 07 2011
%Y Cf. A000302 (4^n), A016897 (5*n+4).
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_
| 