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 A192959 #16 Sep 08 2022 08:45:58 %S A192959 0,1,0,3,10,27,60,121,228,411,718,1227,2064,3433,5664,9291,15178, %T A192959 24723,40188,65233,105780,171411,277630,449523,727680,1177777,1906080, %U A192959 3084531,4991338,8076651,13068828,21146377,34216164,55363563,89580814 %N A192959 Coefficient of x in the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments. %C A192959 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 A192959 G. C. Greubel, <a href="/A192959/b192959.txt">Table of n, a(n) for n = 0..1000</a> %H A192959 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (4,-5,1,2,-1). %F A192959 a(n) = 4*a(n-1) - 5*a(n-2) + a(n-3) + 2*a(n-4) - a(n-5). %F A192959 From _R. J. Mathar_, May 09 2014: (Start) %F A192959 G.f.: x*(1 -4*x +8*x^2 -3*x^3)/((1-x-x^2)*(1-x)^3). %F A192959 a(n) - a(n-1) = A192958(n-1). (End) %F A192959 a(n) = 6*Fibonacci(n+2) - (n^2 + 4*n + 6). - _G. C. Greubel_, Jul 12 2019 %t A192959 (* First program *) %t A192959 q = x^2; s = x + 1; z = 40; %t A192959 p[0, x]:= 1; %t A192959 p[n_, x_]:= x*p[n-1, x] + n^2 - 2; %t A192959 Table[Expand[p[n, x]], {n, 0, 7}] %t A192959 reduce[{p1_, q_, s_, x_}]:= FixedPoint[(s PolynomialQuotient @@ #1 + PolynomialRemainder @@ #1 &)[{#1, q, x}] &, p1] %t A192959 t = Table[reduce[{p[n, x], q, s, x}], {n, 0, z}]; %t A192959 u1 = Table[Coefficient[Part[t, n], x, 0], {n, 1, z}] (* A192958 *) %t A192959 u2 = Table[Coefficient[Part[t, n], x, 1], {n, 1, z}] (* A192959 *) %t A192959 (* Second program *) %t A192959 With[{F=Fibonacci}, Table[6*F[n+2]-(n^2+4*n+6), {n,0,40}]] (* _G. C. Greubel_, Jul 12 2019 *) %o A192959 (PARI) vector(40, n, n--; f=fibonacci; 6*f(n+2)-(n^2+4*n+6)) \\ _G. C. Greubel_, Jul 12 2019 %o A192959 (Magma) F:=Fibonacci; [6*F(n+2)-(n^2+4*n+6): n in [0..40]]; // _G. C. Greubel_, Jul 12 2019 %o A192959 (Sage) f=fibonacci; [6*f(n+2)-(n^2+4*n+6) for n in (0..40)] # _G. C. Greubel_, Jul 12 2019 %o A192959 (GAP) F:=Fibonacci;; List([0..40], n-> 6*F(n+2)-(n^2+4*n+6)); # _G. C. Greubel_, Jul 12 2019 %Y A192959 Cf. A000045, A192232, A192744, A192951, A192958. %K A192959 nonn %O A192959 0,4 %A A192959 _Clark Kimberling_, Jul 13 2011