cp's OEIS Frontend

A164703 a(n) = 8*a(n-2) for n > 2; a(1) = 1, a(2) = 16.

%I A164703 #14 Apr 22 2024 13:29:46
%S A164703 1,16,8,128,64,1024,512,8192,4096,65536,32768,524288,262144,4194304,
%T A164703 2097152,33554432,16777216,268435456,134217728,2147483648,1073741824,
%U A164703 17179869184,8589934592,137438953472,68719476736,1099511627776
%N A164703 a(n) = 8*a(n-2) for n > 2; a(1) = 1, a(2) = 16.
%C A164703 Interleaving of A001018 and 16*A001018.
%C A164703 Binomial transform is A164602.
%H A164703 Vincenzo Librandi, <a href="/A164703/b164703.txt">Table of n, a(n) for n = 1..1000</a>
%H A164703 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (0,8).
%F A164703 a(n) = (3+(-1)^n)*2^(1/4*(6*n-7+3*(-1)^n)).
%F A164703 G.f.: x*(1+16*x)/(1-8*x^2).
%t A164703 Riffle[#, 16*#] & [8^Range[0, 14]] (* or *)
%t A164703 LinearRecurrence[{0, 8}, {1, 16}, 30] (* _Paolo Xausa_, Apr 22 2024 *)
%o A164703 (Magma) [ n le 2 select 15*n-14 else 8*Self(n-2): n in [1..26] ];
%Y A164703 Cf. A001018 (powers of 8), A164602.
%K A164703 nonn,easy
%O A164703 1,2
%A A164703 _Klaus Brockhaus_, Aug 23 2009