login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A linear divisibility sequence of order 8.
2

%I #15 Nov 12 2019 07:16:15

%S 1,4,16,72,271,1024,3809,13968,50992,185364,672079,2433024,8798609,

%T 31797532,114864976,414821664,1497814207,5407599616,19521754897,

%U 70471314792,254385558128,918256161068,3314588702303,11964424716288,43186863073121

%N A linear divisibility sequence of order 8.

%C Let f(x) = 1 + P*x + Q*x^2 + R*x^3 + x^4 be a monic quartic polynomial with integer coefficients. Let g(x) = x^4*f(1/x) = 1 + R*x + Q*x^2 + P*x^3 + x^4 denote the reciprocal polynomial of f(x). Then the rational function x*d/dx( log(f(x)/g(x)) ) is the generating function of a divisibility sequence satisfying a linear recurrence equation of order 8. Here we take f(x) = 1 - x - 2*x^2 - 3*x^3 + x^4 (and normalize the resulting divisibility sequence by removing a common factor of 2 from the terms of the sequence).

%C Roettger et al. constructed a 5-parameter family U_n(P1,P2,P3,P4,Q) of linear divisibility sequences of order 8. This sequence is the particular case of their result with parameters P1 = 4, P2 = -5, P3 = -16, P4 = 20 and Q = 1.

%C There are corresponding results for certain cubic polynomials - see A001945. See also A327542.

%H P. Bala, <a href="/A327541/a327541.pdf">Some linear divisibility sequences of order 8</a>

%H E. L. Roettger, H. C. Williams, R. K. Guy, <a href="https://doi.org/10.1007/978-1-4614-6642-0_15">Some extensions of the Lucas functions</a>, Number Theory and Related Fields: In Memory of Alf van der Poorten, Series: Springer Proceedings in Mathematics & Statistics 43, 271-311 (2013), chapter 5.

%H <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (4,1,-4,-16,-4,1,4,-1).

%F a(n) = (1/2) * Sum_{i = 1..4} (alpha(i)^n - 1/alpha(i)^n), where alpha(i), 1 <= i <= 4, are the zeros of the quartic polynomial 1 - x - 2*x^2 - 3*x^3 + x^4.

%F a(n)^2 = -(1/4) * Product_{i = 1..6} (1 - beta(i)^n), where beta(i), 1 <= i <= 6, are the zeros of the sextic polynomial x^6 + 2*x^5 + 2*x^4 - 14*x^3 + 2*x^2 + 2*x + 1.

%F a(n) = 4*a(n-1) + a(n-2) - 4*a(n-3) - 16*a(n-4) - 4*a(n-5) + a(n-6) + 4*a(n-7) - a(n-8).

%F O.g.f.: x*(x^6 - x^4 + 8*x^3 - x^2 + 1)/((x^4 - x^3 - 2*x^2 - 3*x + 1)*(x^4 - 3*x^3 - 2*x^2 - x + 1)).

%t LinearRecurrence[{4, 1, -4, -16, -4, 1, 4, -1}, {1, 4, 16, 72, 271, 1024, 3809, 13968}, 25] (* _Jean-François Alcover_, Nov 12 2019 *)

%Y Cf. A001351, A001945, A327542.

%K nonn,easy

%O 1,2

%A _Peter Bala_, Sep 22 2019