|
%I #13 Jan 02 2021 19:13:31
%S 1,3,9,26,1,76,4,1,222,16,4,1,648,60,16,4,1,1892,212,62,16,4,1,5524,
%T 728,224,64,16,4,1,16128,2444,788,236,66,16,4,1,47088,8064,2712,848,
%U 248,68,16,4,1,137480,26256,9168,2984,908,260,70,16,4,1,401392,84576,30576
%N Triangle read by rows: T(n,k) is the number of ternary sequences of length n containing k subsequences 000 (consecutively; n,k>=0).
%C Rows 0 and 1 have one term each; row n (n>=2) have n-1 terms. Sum of entries in row n is 3^n (A000244). T(n,0) = A119826(n) T(n,1) = A119827(n) Sum(k*T(n,k), k>=0)=(n-2)*3^(n-3) = A027741(n-1).
%H Alois P. Heinz, <a href="/A119825/b119825.txt">Rows n = 0..150, flattened</a>
%F G.f.: G(t,z)=[1+(1-t)z+(1-t)z^2]/[1-(2+t)z-2(1-t)z^2-2(1-t)z^3].
%e T(5,2) = 4 because we have 00001, 00002, 10000 and 20000.
%e Triangle starts:
%e 1;
%e 3;
%e 9;
%e 26, 1;
%e 76, 4, 1;
%e 222, 16, 4, 1;
%e ...
%p G:=(1+(1-t)*z+(1-t)*z^2)/(1-(2+t)*z-2*(1-t)*z^2-2*(1-t)*z^3): Gser:=simplify(series(G,z=0,15)): P[0]:=1: for n from 1 to 12 do P[n]:=sort(coeff(Gser,z^n)) od: 1;3;for n from 2 to 12 do seq(coeff(P[n],t,j),j=0..n-2) od; # yields sequence in triangular form
%t nn=10; f[list_]:=Select[list,#>0&]; a=x^2/(1-y x) +x; Map[f,CoefficientList[Series[(a+1)/(1-2x-2x a),{x,0,nn}],{x,y}]]//Grid (* _Geoffrey Critzer_, Oct 31 2012 *)
%Y Cf. A000244, A119826, A119827, A027741.
%K nonn,tabf
%O 0,2
%A _Emeric Deutsch_, May 26 2006
|
