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 A192425 #21 Jul 12 2023 05:52:58
%S A192425 0,1,1,6,9,31,60,169,369,954,2201,5479,12960,31721,75881,184326,
%T A192425 443169,1072871,2585340,6249329,15074649,36413754,87877681,212208719,
%U A192425 512231040,1236774481,2985612241,7208270406,17401713849,42012408751
%N A192425 Coefficient of x in the reduction by x^2 -> x+2 of the polynomial p(n,x) defined below in Comments.
%C A192425 The polynomial p(n,x) is defined by ((x+d)/2)^n + ((x-d)/2)^n, where d = sqrt(x^2+4). For an introduction to reductions of polynomials by substitutions such as x^2 -> x+2, see A192232.
%H A192425 G. C. Greubel, <a href="/A192425/b192425.txt">Table of n, a(n) for n = 0..1000</a>
%H A192425 H. C. Williams and R. K. Guy, <a href="http://dx.doi.org/10.1142/S1793042111004587">Some fourth-order linear divisibility sequences</a>, Intl. J. Number Theory 7 (5) (2011) 1255-1277.
%H A192425 H. C. Williams and R. K. Guy, <a href="http://www.emis.de/journals/INTEGERS/papers/a17self/a17self.Abstract.html">Some Monoapparitic Fourth Order Linear Divisibility Sequences</a> Integers, Volume 12A (2012) The John Selfridge Memorial Volume
%H A192425 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (1,4,-1,-1).
%F A192425 G.f.: x*(1+x^2)/((1+x-x^2)*(1-2*x-x^2)). _Colin Barker_, Nov 13 2012
%F A192425 From _Peter Bala_, Mar 26 2015: (Start)
%F A192425 The following remarks assume the o.g.f. for this sequence is x*(1 + x^2)/((1 + x - x^2)*(1 - 2*x - x^2)).
%F A192425 This sequence is a fourth-order linear divisibility sequence. It is the case P1 = 1, P2 = -2, Q = -1 of the 3-parameter family of divisibility sequences found by Williams and Guy.
%F A192425 exp( Sum_{n >= 1} 3*a(n)*x^n/n ) = 1 + Sum_{n >= 1} 3*Pell(n)*x^n.
%F A192425 exp( Sum_{n >= 1} (-3)*a(n)*x^n/n ) = 1 + Sum_{n >= 1} 3*Fibonacci(n)*(-x)^n. Cf. A002878. (End)
%F A192425 From _G. C. Greubel_, Jul 12 2023: (Start)
%F A192425 a(n) = Sum_{j=0..n} T(n, j)*A001045(j), where T(n, k) = [x^k] ((x + sqrt(x^2+4))^n + (x - sqrt(x^2+4))^n)/2^n.
%F A192425 a(n) = a(n-1) + 4*a(n-2) - a(n-3) - a(n-4).
%F A192425 a(n) = (1/3)*( 2*A000129(n+1) - 2*A000129(n) - (-1)^n*A000032(n)). (End)
%e A192425 The first five polynomials p(n,x) and their reductions are as follows:
%e A192425 p(0,x) = 2 -> 2
%e A192425 p(1,x) = x -> x
%e A192425 p(2,x) = 2 + x^2 -> 4 + x
%e A192425 p(3,x) = 3*x + x^3 -> 2 + 6*x
%e A192425 p(4,x) = 2 + 4*x^2 + x^4 -> 16 + 9*x.
%e A192425 From these, read A192423(n) = = 2*A192424(n) = (2, 0, 4, 2, 16, ...) and a(n) = (0, 1, 1, 6, 9, ...).
%t A192425 (See A192423.)
%t A192425 LinearRecurrence[{1,4,-1,-1}, {0,1,1,6}, 40] (* _G. C. Greubel_, Jul 12 2023 *)
%o A192425 (Magma) R<x>:=PowerSeriesRing(Integers(), 40); [0] cat Coefficients(R!( x*(1+x^2)/((1+x-x^2)*(1-2*x-x^2)) )); // _G. C. Greubel_, Jul 12 2023
%o A192425 (SageMath)
%o A192425 @CachedFunction
%o A192425 def a(n): # a = A192425
%o A192425 if (n<4): return (0,1,1,6)[n]
%o A192425 else: return a(n-1) +4*a(n-2) -a(n-3) -a(n-4)
%o A192425 [a(n) for n in range(41)] # _G. C. Greubel_, Jul 12 2023
%Y A192425 Cf. A000045, A000129, A001045, A002878, A192232, A192423, A192424.
%K A192425 nonn,easy
%O A192425 0,4
%A A192425 _Clark Kimberling_, Jun 30 2011