cp's OEIS Frontend

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.

A164640 a(n) = 8*a(n-2) for n > 2; a(1) = 1, a(2) = 6.

This page as a plain text file.
%I A164640 #12 Sep 08 2022 08:45:47
%S A164640 1,6,8,48,64,384,512,3072,4096,24576,32768,196608,262144,1572864,
%T A164640 2097152,12582912,16777216,100663296,134217728,805306368,1073741824,
%U A164640 6442450944,8589934592,51539607552,68719476736,412316860416
%N A164640 a(n) = 8*a(n-2) for n > 2; a(1) = 1, a(2) = 6.
%C A164640 Interleaving of A001018 and A083233 without initial term 1.
%C A164640 Binomial transform is A164544. Third binomial transform is A038761.
%H A164640 Vincenzo Librandi, <a href="/A164640/b164640.txt">Table of n, a(n) for n = 1..300</a>
%H A164640 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (0, 8).
%F A164640 a(n) = (7-(-1)^n)*2^(1/4*(6*n -15+3*(-1)^n)).
%F A164640 G.f.: x*(1+6*x)/(1-8*x^2).
%t A164640 LinearRecurrence[{0,8},{1,6},40] (* _Harvey P. Dale_, Nov 06 2013 *)
%o A164640 (Magma) [ n le 2 select 5*n-4 else 8*Self(n-2): n in [1..26] ];
%o A164640 (PARI) a(n)=(7-(-1)^n)*2^(1/4*(6*n-15+3*(-1)^n)) \\ _Charles R Greathouse IV_, Oct 07 2015
%Y A164640 Cf. A001018 (powers of 8), A083233 ((3*8^n+(0)^n)/4), A164544, A038761.
%K A164640 nonn,easy
%O A164640 1,2
%A A164640 _Klaus Brockhaus_, Aug 20 2009
%E A164640 G.f. corrected by _Klaus Brockhaus_, Sep 18 2009