|
%I #22 May 21 2020 10:26:31
%S 0,1,3,3,6,8,11,16,21,29,39,52,70,93,124,165,219,291,386,512,679,900,
%T 1193,1581,2095,2776,3678,4873,6456,8553,11331,15011,19886,26344,
%U 34899,46232,61245,81133,107479,142380,188614,249861,330996,438477,580859,769475
%N a(n) = a(n-1) + a(n-2) - a(n-4) starting a(0)=0, a(1)=1, a(2)=a(3)=3.
%C The limiting ratio a(n+1)/a(n) is the same as with A000931, which is A060006.
%D R. Pallu de la Barriere, Optimal Control Theory, Dover Publications, New York, 1967, pages 339-344
%H G. C. Greubel, <a href="/A168637/b168637.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,0,-1).
%F G.f.: x*(1 + 2*x - x^2)/((1-x)*(1 - x^2 - x^3)). [Dec 03 2009]
%F a(n) = 3*A000931(n+4) + 2*A000931(n+3) - 2. [Dec 03 2009]
%F a(n) = a(n-2) + a(n-3) + 2. - _Greg Dresden_, May 18 2020
%t LinearRecurrence[{1,1,0,-1},{0,1,3,3},50] (* or *) CoefficientList[ Series[ x*(-1-2x+x^2)/((1-x)(x^3+x^2-1)),{x,0,50}],x] (* _Harvey P. Dale_, Jun 22 2011 *)
%o (PARI) a(n)=([0,1,0,0; 0,0,1,0; 0,0,0,1; -1,0,1,1]^n*[0;1;3;3])[1,1] \\ _Charles R Greathouse IV_, Jul 29 2016
%Y Cf. A007307 (for a different starting vector of the Mma program).
%K nonn,easy
%O 0,3
%A _Roger L. Bagula_ and _Gary W. Adamson_, Dec 01 2009
%E Precise definition and more formulas supplied by the Assoc. Editors of the OEIS, Dec 03 2009
|
