cp's OEIS Frontend

A007800 From a problem in AI planning: a(n) = 4+a(n-1)+a(n-2)+a(n-3)+a(n-4)-a(n-5)-a(n-6)-a(n-7), n>7.

%I A007800 #33 May 22 2024 02:11:20
%S A007800 1,2,4,8,16,31,59,111,207,384,710,1310,2414,4445,8181,15053,27693,
%T A007800 50942,93704,172356,317020,583099,1072495,1972635,3628251,6673404,
%U A007800 12274314,22575994,41523738,76374073,140473833,258371673,475219609,874065146
%N A007800 From a problem in AI planning: a(n) = 4+a(n-1)+a(n-2)+a(n-3)+a(n-4)-a(n-5)-a(n-6)-a(n-7), n>7.
%C A007800 The number of length n binary words with fewer than 3 zeros between any pair of consecutive ones. - _Jeffrey Liese_, Dec 23 2010
%H A007800 Robert Israel, <a href="/A007800/b007800.txt">Table of n, a(n) for n = 1..3397</a>
%H A007800 T. Langley, J. Liese, and J. Remmel, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL14/Langley/langley2.html">Generating Functions for Wilf Equivalence Under Generalized Factor Order</a>, J. Int. Seq. 14 (2011) # 11.4.2.
%H A007800 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (3,-2,0,-1,1).
%F A007800 a(1)=1, a(2)=2, a(3)=4, a(4)=8, a(5)=16, a(n)=3*a(n-1)-2*a(n-2)+0*a(n-3)- a(n-4)+ a(n-5). - _Harvey P. Dale_, Apr 24 2013
%F A007800 G.f.: -x*(x^4-x+1) / ((x-1)^2*(x^3+x^2+x-1)). - _Colin Barker_, Aug 18 2014
%F A007800 2*a(n) = A001590(n+4)-n. - _R. J. Mathar_, Aug 16 2017
%p A007800 for n from 1 to 5 do a[n]:= [1,2,4,8,16][n] od:
%p A007800 for n from 6 to 100 do a[n]:= 3*a[n-1]-2*a[n-2]-a[n-4]+a[n-5] od:
%p A007800 seq(a[n],n=1..100); # _Robert Israel_, Aug 19 2014
%t A007800 LinearRecurrence[{3,-2,0,-1,1},{1,2,4,8,16},40] (* _Harvey P. Dale_, Apr 24 2013 *)
%o A007800 (PARI) Vec(-x*(x^4-x+1)/((x-1)^2*(x^3+x^2+x-1)) + O(x^100)) \\ _Colin Barker_, Aug 18 2014
%Y A007800 Cf. A062544.
%K A007800 nonn,easy
%O A007800 1,2
%A A007800 Peter Jonsson [ petej(AT)ida.liu.se ]