This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A164675 #12 Apr 22 2024 13:27:49
%S A164675 1,12,8,96,64,768,512,6144,4096,49152,32768,393216,262144,3145728,
%T A164675 2097152,25165824,16777216,201326592,134217728,1610612736,1073741824,
%U A164675 12884901888,8589934592,103079215104,68719476736,824633720832
%N A164675 a(n) = 8*a(n-2) for n > 2; a(1) = 1, a(2) = 12.
%C A164675 Interleaving of A001018 and 12*A001018.
%C A164675 Binomial transform is A164539.
%H A164675 Vincenzo Librandi, <a href="/A164675/b164675.txt">Table of n, a(n) for n = 1..500</a>
%H A164675 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (0,8).
%F A164675 a(n) = (5+(-1)^n)*2^(1/4*(6*n-11+3*(-1)^n)).
%F A164675 G.f.: x*(1+12*x)/(1-8*x^2).
%t A164675 Riffle[#, 12*#] & [8^Range[0, 14]] (* or *)
%t A164675 LinearRecurrence[{0, 8}, {1, 12}, 30] (* _Paolo Xausa_, Apr 22 2024 *)
%o A164675 (Magma) [ n le 2 select 11*n-10 else 8*Self(n-2): n in [1..26] ];
%Y A164675 Cf. A001018 (powers of 8), A164539.
%K A164675 nonn,easy
%O A164675 1,2
%A A164675 _Klaus Brockhaus_, Aug 20 2009