|
%I #25 May 06 2023 09:01:05
%S 1,2,4,7,11,16,26,43,71,116,186,300,487,792,1287,2087,3382,5484,8898,
%T 14438,23423,37993,61625,99965,162165,263065,426736,692229,1122903,
%U 1821538,2954849,4793266,7775472,12613097,20460538,33190414,53840404
%N a(n) is the number of binary strings of length n such that no subsequence of length 5 or less contains 3 or more ones.
%H G. C. Greubel, <a href="/A120118/b120118.txt">Table of n, a(n) for n = 0..1000</a>
%H Kees Immink and Kui Cai, <a href="https://doi.org/10.1109/LCOMM.2020.2993467">Properties and constructions of energy-harvesting sliding-window constrained codes</a>, IEEE Comm. Lett., May 2020.
%H <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,1,0,2,0,0,-1,0,-1).
%F a(n) = a(n-1) + a(n-3) + 2*a(n-5) - a(n-8) - a(n-10).
%F G.f.: 1 + x*(1+x+x^2)*(2+x^2+x^3-x^4-x^5-x^7)/(1-x-x^3-2*x^5+x^8+x^10). - _R. J. Mathar_, Nov 28 2011
%e This sequence is similar to A118647 - where no subsequence of length 4 contains 3 ones. It is obvious that the first 4 terms of these two sequences are the same. There are only 3 sequences of length 5 that contain 3 ones such that no subsequence of length 4 contains 3 ones: 10101, 11001, 10011. Hence the fifth term for this sequence is 3 less than the corresponding term of A118647.
%t LinearRecurrence[{1,0,1,0,2,0,0,-1,0,-1}, {1,2,4,7,11,16,26,43,71,116, 186}, 50] (* _Harvey P. Dale_, Nov 27 2013 *)
%o (Magma) R<x>:=PowerSeriesRing(Integers(), 40); Coefficients(R!( 1 +x*(1 +x+x^2)*(2+x^2+x^3-x^4-x^5-x^7)/(1-x-x^3-2*x^5+x^8+x^10) )); // _G. C. Greubel_, May 05 2023
%o (SageMath)
%o def A120118_list(prec):
%o P.<x> = PowerSeriesRing(ZZ, prec)
%o return P( 1 +x*(1+x+x^2)*(2+x^2+x^3-x^4-x^5-x^7)/(1-x-x^3-2*x^5 +
%o x^8+x^10) ).list()
%o A120118_list(40) # _G. C. Greubel_, May 05 2023
%Y Cf. A118647, A133523, A133551, A334251, A335247.
%K nonn,easy
%O 0,2
%A _Tanya Khovanova_, Aug 15 2006, Oct 11 2006
|
