Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #19 Feb 15 2021 23:04:23
%S 0,0,1,7,27,81,213,519,1207,2725,6033,13179,28515,61257,130861,278287,
%T 589551,1244877,2621097,5504643,11533915,24116785,50331141,104857047,
%U 218103207,452984181,939523393,1946156299,4026531027,8321498265,17179868253,35433479199,73014442975,150323854237
%N Number of ternary strings of length n that contain at least two 0's and at most one 1.
%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (7,-19,25,-16,4).
%F a(n) = 2^n + n*2^(n-1) - 2*binomial(n,2) - 2*n - 1.
%F E.g.f.: exp(x)*(exp(x) - 1 - x)*(1 + x).
%F G.f.: x^2*(1 - 3*x^2)/((1 - 2*x)^2*(1 - x)^3). - _Stefano Spezia_, Jan 31 2021
%e a(4) = 27 since the strings consist of 0000, the 4 permutations of 0001, the 4 permutations of 0002, the 6 permutations of 0022, and the 12 permutations of 0012. The total number of strings is then 1 + 4 + 4 + 6 + 12 = 27.
%t CoefficientList[Series[Exp[x](Exp[x]-1-x)(1+x),{x,0,32}],x]Table[i!,{i,0,32}] (* _Stefano Spezia_, Jan 31 2021 *)
%Y Cf. A186244, A186314.
%Y Cf. A338229, A338232.
%K nonn,easy
%O 0,4
%A _Enrique Navarrete_, Jan 30 2021