This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A192965 #12 Sep 08 2022 08:45:58 %S A192965 0,1,1,4,11,27,58,115,215,386,673,1149,1932,3213,5301,8696,14207, %T A192965 23143,37622,61071,99035,160486,259941,420889,681336,1102777,1784713, %U A192965 2888140,4673555,7562451,12236818,19800139,32037887,51839018,83877961 %N A192965 Coefficient of x in the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments. %C A192965 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 A192965 G. C. Greubel, <a href="/A192965/b192965.txt">Table of n, a(n) for n = 0..1000</a> %H A192965 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (4,-5,1,2,-1). %F A192965 a(n) = 4*a(n-1) - 5*a(n-2) + a(n-3) + 2*a(n-4) - a(n-5). %F A192965 G.f.: x*(1 -3*x +5*x^2 -x^3)/((1-x-x^2)*(1-x)^3). - _R. J. Mathar_, May 11 2014 %F A192965 a(n) = Fibonacci(n+4) + 3*Fibonacci(n+2) - (n^2 + 3*n + 6). - _G. C. Greubel_, Jul 11 2019 %t A192965 (* First program *) %t A192965 q = x^2; s = x + 1; z = 40; %t A192965 p[0, x]:= 1; %t A192965 p[n_, x_]:= x*p[n-1, x] + n(n-1); %t A192965 Table[Expand[p[n, x]], {n, 0, 7}] %t A192965 reduce[{p1_, q_, s_, x_}]:= FixedPoint[(s PolynomialQuotient @@ #1 + PolynomialRemainder @@ #1 &)[{#1, q, x}] &, p1] %t A192965 t = Table[reduce[{p[n, x], q, s, x}], {n, 0, z}]; %t A192965 u1 = Table[Coefficient[Part[t, n], x, 0], {n, 1, z}] (* A192964 *) %t A192965 u2 = Table[Coefficient[Part[t, n], x, 1], {n, 1, z}] (* A192965 *) %t A192965 (* Second program *) %t A192965 With[{F=Fibonacci}, Table[F[n+4]+3*F[n+2] -(n^2+3*n+6), {n,0,40}]] (* _G. C. Greubel_, Jul 11 2019 *) %o A192965 (PARI) vector(40, n, n--; f=fibonacci; f(n+4)+3*f(n+2)-(n^2+3*n+6)) \\ _G. C. Greubel_, Jul 11 2019 %o A192965 (Magma) F:=Fibonacci; [F(n+4) +3*F(n+2) -(n^2+3*n+6): n in [0..40]]; // _G. C. Greubel_, Jul 11 2019 %o A192965 (Sage) f=fibonacci; [f(n+4) +3*f(n+2) -(n^2+3*n+6) for n in (0..40)] # _G. C. Greubel_, Jul 11 2019 %o A192965 (GAP) F:=Fibonacci;; List([0..40], n-> F(n+4) +3*F(n+2) -(n^2+3*n+6)); # _G. C. Greubel_, Jul 11 2019 %Y A192965 Cf. A000045, A192232, A192744, A192951, A192964. %K A192965 nonn %O A192965 0,4 %A A192965 _Clark Kimberling_, Jul 13 2011