|
%I #17 Sep 08 2022 08:45:58
%S 0,1,1,3,8,20,44,89,169,307,540,928,1568,2617,4329,7115,11640,18980,
%T 30876,50145,81345,131851,213596,345888,559968,906385,1466929,2373939,
%U 3841544,6216212,10058540,16275593,26335033,42611587,68947644,111560320
%N Coefficient of x in the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments.
%C The titular polynomials are defined recursively: p(n,x) = x*p(n-1,x) + (n-1)^2, with p(0,x)=1. For an introduction to reductions of polynomials by substitutions such as x^2 -> x+1, see A192232 and A192744.
%H Vincenzo Librandi, <a href="/A192982/b192982.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (4,-5,1,2,-1).
%F a(n) = 4*a(n-1) - 5*a(n-2) + a(n-3) + 2*a(n-4) - a(n-5).
%F G.f.: x*(1-3*x+4*x^2)/((1-x-x^2)*(1-x)^3). - _R. J. Mathar_, May 12 2014
%F a(n) = Lucas(n+3) + Fibonacci(n+2) - (n^2 + 2*n + 5). - _G. C. Greubel_, Jul 25 2019
%t (* First program *)
%t q = x^2; s = x + 1; z = 40;
%t p[0, x]:= 1;
%t p[n_, x_]:= x*p[n-1, x] + (n-1)^2;
%t Table[Expand[p[n, x]], {n, 0, 7}]
%t reduce[{p1_, q_, s_, x_}]:= FixedPoint[(s PolynomialQuotient @@ #1 + PolynomialRemainder @@ #1 &)[{#1, q, x}] &, p1]
%t t = Table[reduce[{p[n, x], q, s, x}], {n, 0, z}];
%t u1 = Table[Coefficient[Part[t, n], x, 0], {n, 1, z}] (* A192981 *)
%t u2 = Table[Coefficient[Part[t, n], x, 1], {n, 1, z}] (* A192982 *)
%t (* Additional programs *)
%t CoefficientList[Series[x*(1-3*x+4*x^2)/((1-x-x^2)*(1-x)^3), {x, 0, 40}], x] (* _Vincenzo Librandi_, May 13 2014 *)
%t Table[LucasL[n+3]+Fibonacci[n+2]-(n^2+2*n+5), {n,0,40}] (* _G. C. Greubel_, Jul 25 2019 *)
%o (PARI) vector(40, n, n--; f=fibonacci; f(n+4)+2*f(n+2) -(n^2+2*n+5)) \\ _G. C. Greubel_, Jul 25 2019
%o (Magma) F:=Fibonacci; [F(n+4)+2*F(n+2) -(n^2+2*n+5): n in [0..40]]; // _G. C. Greubel_, Jul 25 2019
%o (Sage) f=fibonacci; [f(n+4)+2*f(n+2) -(n^2+2*n+5) for n in (0..40)] # _G. C. Greubel_, Jul 25 2019
%o (GAP) F:=Fibonacci;; List([0..40], n-> F(n+4)+2*F(n+2) -(n^2+2*n+5)); # _G. C. Greubel_, Jul 25 2019
%Y Cf. A000032, A000045, A192232, A192744, A192951, A192981.
%K nonn,easy
%O 0,4
%A _Clark Kimberling_, Jul 14 2011
|
