%I M3284 #49 Jun 25 2023 21:07:20
%S 0,1,1,4,6,16,28,64,120,256,496,1024,2016,4096,8128,16384,32640,65536,
%T 130816,262144,523776,1048576,2096128,4194304,8386560,16777216,
%U 33550336,67108864,134209536,268435456,536854528,1073741824,2147450880,4294967296,8589869056
%N Dual pairs of integrals arising from reflection coefficients.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Vincenzo Librandi, <a href="/A007179/b007179.txt">Table of n, a(n) for n = 0..200</a>
%H Paul Barry, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL8/Barry/barry84.html">A Catalan Transform and Related Transformations on Integer Sequences</a>, Journal of Integer Sequences, Vol. 8 (2005), Article 05.4.5.
%H J. Heading, <a href="http://dx.doi.org/10.1088/0305-4470/14/2/011">Theorem relating to the development of a reflection coefficient in terms of a small parameter</a>, J. Phys. A 14 (1981), 357-367.
%H Kyu-Hwan Lee, Se-jin Oh, <a href="http://arxiv.org/abs/1601.06685">Catalan triangle numbers and binomial coefficients</a>, arXiv:1601.06685 [math.CO], 2016.
%H A. Yajima, <a href="https://www.jstage.jst.go.jp/article/bcsj/87/11/87_20140204/_pdf">How to calculate the number of stereoisomers of inositol-homologs</a>, Bull. Chem. Soc. Jpn. 2014, 87, 1260-1264 | doi:10.1246/bcsj.20140204. See Tables 1 and 2 (and text). - _N. J. A. Sloane_, Mar 26 2015
%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (2,2,-4).
%F From _Paul Barry_, Apr 28 2004: (Start)
%F Binomial transform is (A000244(n)+A001333(n))/2.
%F G.f.: x*(1-x)/((1-2*x)*(1-2*x^2)).
%F a(n) = 2*a(n-1)+2*a(n-2)-4*a(n-3).
%F a(n) = 2^n/2-2^(n/2)*(1+(-1)^n)/4. (End)
%F G.f.: (1+x*Q(0))*x/(1-x), where Q(k)= 1 - 1/(2^k - 2*x*2^(2*k)/(2*x*2^k - 1/(1 + 1/(2*2^k - 8*x*2^(2*k)/(4*x*2^k + 1/Q(k+1)))))); (continued fraction). - _Sergei N. Gladkovskii_, May 22 2013
%F a(n) = A011782(n+2) - A077957(n) - _Gus Wiseman_, Feb 26 2022
%e From _Gus Wiseman_, Feb 26 2022: (Start)
%e Also the number of integer compositions of n with at least one odd part. For example, the a(1) = 1 through a(5) = 16 compositions are:
%e (1) (1,1) (3) (1,3) (5)
%e (1,2) (3,1) (1,4)
%e (2,1) (1,1,2) (2,3)
%e (1,1,1) (1,2,1) (3,2)
%e (2,1,1) (4,1)
%e (1,1,1,1) (1,1,3)
%e (1,2,2)
%e (1,3,1)
%e (2,1,2)
%e (2,2,1)
%e (3,1,1)
%e (1,1,1,2)
%e (1,1,2,1)
%e (1,2,1,1)
%e (2,1,1,1)
%e (1,1,1,1,1)
%e (End)
%p f := n-> if n mod 2 = 0 then 2^(n-1)-2^((n-2)/2) else 2^(n-1); fi;
%t LinearRecurrence[{2,2,-4},{0,1,1},30] (* _Harvey P. Dale_, Nov 30 2015 *)
%t Table[2^(n-1)-If[EvenQ[n],2^(n/2-1),0],{n,0,15}] (* _Gus Wiseman_, Feb 26 2022 *)
%o (Magma) [Floor(2^n/2-2^(n/2)*(1+(-1)^n)/4): n in [0..40]]; // _Vincenzo Librandi_, Aug 20 2011
%o (PARI) Vec(x*(1-x)/((1-2*x)*(1-2*x^2)) + O(x^50)) \\ _Michel Marcus_, Jan 28 2016
%Y Column k=2 of A309748.
%Y Odd bisection is A000302.
%Y Even bisection is A006516 = 2^(n-1)*(2^n - 1).
%Y The complement is counted by A077957, internal version A027383.
%Y The internal case is A274230, even bisection A134057.
%Y A000045(n-1) counts compositions without odd parts, non-singleton A077896.
%Y A003242 counts Carlitz compositions.
%Y A011782 counts compositions.
%Y A034871, A097805, and A345197 count compositions by alternating sum.
%Y A052952 (or A074331) counts non-singleton compositions without even parts.
%Y Cf. A000918, A033484, A052955, A060867, A116406, A138364.
%K nonn,easy
%O 0,4
%A _N. J. A. Sloane_, _Simon Plouffe_