login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A192963 Coefficient of x in the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments. 3

%I #14 Apr 03 2023 15:15:24

%S 0,1,3,10,25,55,110,207,373,652,1115,1877,3124,5157,8463,13830,22533,

%T 36635,59474,96451,156305,253176,409943,663625,1074120,1738345,

%U 2813115,4552162,7366033,11919007,19285910,31205847,50492749,81699652

%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 + 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 G. C. Greubel, <a href="/A192963/b192963.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 -x +3*x^2 -x^3)/((1-x-x^2)*(1-x)^3). - _R. J. Mathar_, May 11 2014

%F a(n) = 3*Fibonacci(n+3) + 4*Fibonacci(n+2) - (n^2 + 5*n +10). - _G. C. Greubel_, Jul 12 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(n+1);

%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}] (* A192962 *)

%t u2 = Table[Coefficient[Part[t, n], x, 1], {n, 1, z}] (* A192963 *)

%t (* Second program *)

%t With[{F=Fibonacci}, Table[3*F[n+3]+4*F[n+2] -(n^2+5*n+10), {n,0,40}]] (* _G. C. Greubel_, Jul 11 2019 *)

%t LinearRecurrence[{4,-5,1,2,-1},{0,1,3,10,25},50] (* _Harvey P. Dale_, Apr 03 2023 *)

%o (PARI) vector(40, n, n--; f=fibonacci; 3*f(n+4)+4*f(n+2)-(n^2+5*n+10)) \\ _G. C. Greubel_, Jul 12 2019

%o (Magma) F:=Fibonacci; [3*F(n+4) +4*F(n+2) -(n^2+5*n+10): n in [0..40]]; // _G. C. Greubel_, Jul 12 2019

%o (Sage) f=fibonacci; [3*f(n+4) +4*f(n+2) -(n^2+5*n+10) for n in (0..40)] # _G. C. Greubel_, Jul 12 2019

%o (GAP) F:=Fibonacci;; List([0..40], n-> 3*F(n+4) +4*F(n+2) -(n^2+5*n+10)); # _G. C. Greubel_, Jul 12 2019

%Y Cf. A000045, A192232, A192744, A192951, A192962.

%K nonn

%O 0,3

%A _Clark Kimberling_, Jul 13 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)