cp's OEIS Frontend

A192960 Constant term of the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments.

%I A192960 #16 Sep 08 2022 08:45:58
%S A192960 1,3,7,15,29,53,93,159,267,443,729,1193,1945,3163,5135,8327,13493,
%T A192960 21853,35381,57271,92691,150003,242737,392785,635569,1028403,1664023,
%U A192960 2692479,4356557,7049093,11405709,18454863,29860635,48315563,78176265
%N A192960 Constant term of the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments.
%C A192960 The titular polynomials are defined recursively:  p(n,x) = x*p(n-1,x) + 2 + n^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 A192960 G. C. Greubel, <a href="/A192960/b192960.txt">Table of n, a(n) for n = 0..1000</a>
%H A192960 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (3,-2,-1,1).
%F A192960 a(n) = 3*a(n-1) - 2*a(n-2) - a(n-3) + a(n-4).
%F A192960 From _R. J. Mathar_, May 09 2014: (Start)
%F A192960 G.f.: (1+x)*(1-x+x^2)/((1-x-x^2)*(1-x)^2).
%F A192960 a(n) - a(n-1) = A019274(n+2). (End)
%F A192960 a(n) = 2*Fibonacci(n+4) - (2*n + 5). - _G. C. Greubel_, Jul 12 2019
%t A192960 (* First program *)
%t A192960 q = x^2; s = x + 1; z = 40;
%t A192960 p[0, x]:= 1;
%t A192960 p[n_, x_]:= x*p[n - 1, x] + n^2 + 2;
%t A192960 Table[Expand[p[n, x]], {n, 0, 7}]
%t A192960 reduce[{p1_, q_, s_, x_}]:= FixedPoint[(s PolynomialQuotient @@ #1 + PolynomialRemainder @@ #1 &)[{#1, q, x}] &, p1]
%t A192960 t = Table[reduce[{p[n, x], q, s, x}], {n, 0, z}];
%t A192960 u1 = Table[Coefficient[Part[t, n], x, 0], {n, 1, z}] (* A192960 *)
%t A192960 u2 = Table[Coefficient[Part[t, n], x, 1], {n, 1, z}] (* A192961 *)
%t A192960 (* Second program *)
%t A192960 With[{F=Fibonacci}, Table[2*F[n+4]-(2*n+5), {n,0,40}]] (* _G. C. Greubel_, Jul 12 2019 *)
%o A192960 (PARI) vector(40, n, n--; f=fibonacci; 2*f(n+4)-(2*n+5)) \\ _G. C. Greubel_, Jul 12 2019
%o A192960 (Magma) F:=Fibonacci; [2*F(n+4)-(2*n+5): n in [0..40]]; // _G. C. Greubel_, Jul 12 2019
%o A192960 (Sage) f=fibonacci; [2*f(n+4)-(2*n+5) for n in (0..40)] # _G. C. Greubel_, Jul 12 2019
%o A192960 (GAP) F:=Fibonacci;; List([0..40], n-> 2*F(n+4)-(2*n+5)); # _G. C. Greubel_, Jul 12 2019
%Y A192960 Cf. A000045, A192232, A192744, A192951, A192961.
%K A192960 nonn
%O A192960 0,2
%A A192960 _Clark Kimberling_, Jul 13 2011