|
%I #28 Sep 08 2022 08:44:38
%S 8,128,2048,32768,524288,8388608,134217728,2147483648,34359738368,
%T 549755813888,8796093022208,140737488355328,2251799813685248,
%U 36028797018963968,576460752303423488,9223372036854775808
%N a(n) = 2^(4*n + 3).
%H Vincenzo Librandi, <a href="/A013777/b013777.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/Di#divseq">Index to divisibility sequences</a>
%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (16).
%F From _Philippe Deléham_, Nov 23 2008: (Start)
%F a(n) = 16*a(n-1); a(0)=8.
%F G.f.: 8/(1-16x). (End)
%o (Sage) [lucas_number1(4*n, 2, 0) for n in range(1, 17)] # _Zerinvary Lajos_, Oct 27 2009
%o (Magma) [2^(4*n+3): n in [0..20]]; // _Vincenzo Librandi_, Jun 27 2011
%o (PARI) a(n)=8<<(4*n) \\ _Charles R Greathouse IV_, Apr 08 2012
%Y Subsequence of A000079.
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_
| 