cp's OEIS Frontend

A116406 Expansion of ((1 + x - 2x^2) + (1+x)*sqrt(1-4x^2))/(2(1-4x^2)).

%I A116406 #32 Jan 18 2022 06:55:05
%S A116406 1,1,2,3,7,11,26,42,99,163,382,638,1486,2510,5812,9908,22819,39203,
%T A116406 89846,155382,354522,616666,1401292,2449868,5546382,9740686,21977516,
%U A116406 38754732,87167164,154276028,345994216,614429672,1374282019,2448023843
%N A116406 Expansion of ((1 + x - 2x^2) + (1+x)*sqrt(1-4x^2))/(2(1-4x^2)).
%C A116406 Interleaving of A114121 and A032443. Row sums of A116405. Binomial transform is A116409.
%C A116406 Appears to be the number of n-digit binary numbers not having more zeros than ones; equivalently, the number of unrestricted Dyck paths of length n not going below the axis. - _Ralf Stephan_, Mar 25 2008
%C A116406 From _Gus Wiseman_, Jun 20 2021: (Start)
%C A116406 Also the number compositions of n with alternating sum >= 0, where the alternating sum of a sequence (y_1,...,y_k) is Sum_i (-1)^(i-1) y_i. The a(0) = 1 through a(5) = 11 compositions are:
%C A116406   ()  (1)  (2)   (3)    (4)     (5)
%C A116406            (11)  (21)   (22)    (32)
%C A116406                  (111)  (31)    (41)
%C A116406                         (112)   (113)
%C A116406                         (121)   (122)
%C A116406                         (211)   (212)
%C A116406                         (1111)  (221)
%C A116406                                 (311)
%C A116406                                 (1121)
%C A116406                                 (2111)
%C A116406                                 (11111)
%C A116406 (End)
%C A116406 From _J. Stauduhar_, Jan 14 2022: (Start)
%C A116406 Also, for n >= 2, first differences of partial row sums of Pascal's triangle. The first ceiling(n/2)+1 elements of rows n=0 to n=4 in Pascal's triangle are:
%C A116406      1
%C A116406     1 1
%C A116406    1 2
%C A116406   1 3 3
%C A116406 1 4 6
%C A116406 ...
%C A116406 The cumulative sums of these partial rows form the sequence 1,3,6,13,24,..., and its first differences are a(2),a(3),a(4),... in this sequence.
%C A116406 (End)
%F A116406 a(n) = A114121(n/2)*(1+(-1)^n)/2 + A032443((n-1)/2)*(1-(-1)^n)/2.
%F A116406 a(n) = Sum_{k=0..floor(n/2)} binomial(n-1,k). - _Paul Barry_, Oct 06 2007
%F A116406 Conjecture: n*(n-3)*a(n) +2*(-n^2+4*n-2)*a(n-1) -4*(n-2)^2*a(n-2) +8*(n-2)*(n-3)*a(n-3)=0. - _R. J. Mathar_, Nov 28 2014
%F A116406 a(n) ~ 2^(n-2) * (1 + (3+(-1)^n)/sqrt(2*Pi*n)). - _Vaclav Kotesovec_, May 30 2016
%F A116406 a(n) = 2^(n-1) - A294175(n). - _Gus Wiseman_, Jun 27 2021
%t A116406 CoefficientList[Series[((1+x-2x^2)+(1+x)Sqrt[1-4x^2])/(2(1-4x^2)),{x,0,40}],x] (* _Harvey P. Dale_, Aug 16 2012 *)
%t A116406 ats[y_]:=Sum[(-1)^(i-1)*y[[i]],{i,Length[y]}];Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],ats[#]>=0&]],{n,0,15}] (* _Gus Wiseman_, Jun 20 2021 *)
%Y A116406 The alternating sum = 0 case is A001700 or A088218.
%Y A116406 The alternating sum > 0 case appears to be A027306.
%Y A116406 The bisections are  A032443 (odd) and A114121 (even).
%Y A116406 The alternating sum <= 0 version is A058622.
%Y A116406 The alternating sum < 0 version is A294175.
%Y A116406 The restriction to reversed partitions is A344607.
%Y A116406 A103919 counts partitions by sum and alternating sum (reverse: A344612).
%Y A116406 A124754 gives the alternating sum of standard compositions.
%Y A116406 A344610 counts partitions by sum and positive reverse-alternating sum.
%Y A116406 A344616 lists the alternating sums of partitions by Heinz number.
%Y A116406 Cf. A000041, A000070, A000097, A003242, A006330, A028260, A058696, A119899, A239830, A344605, A344611, A344650, A344739.
%K A116406 easy,nonn
%O A116406 0,3
%A A116406 _Paul Barry_, Feb 13 2006