OFFSET
1,2
COMMENTS
This is a divisibility sequence, that is, if n | m then a(n) | a(m). This is a consequence of the following more general result: The polynomials P(n,x,y) := (x^n + y^n)*(x^(3*n) - y^(3*n)) form a divisibility sequence in the polynomial ring Z[x,y]. See the Bala link.
The sequence satisfies a homogeneous linear recurrence of the fourth order. However, it does not belong to the family of linear divisibility sequences of the fourth order studied by Williams and Guy, which have o.g.f.s of the form x*(1 - q*x^2)/Q(x), Q(x) a quartic polynomial and q an integer.
LINKS
Wikipedia, Divisibility sequence"
H. C. Williams and R. K. Guy, Some fourth-order linear divisibility sequences, Intl. J. Number Theory 7 (5) (2011) 1255-1277.
H. C. Williams and R. K. Guy, Some Monoapparitic Fourth Order Linear Divisibility Sequences Integers, Volume 12A (2012) The John Selfridge Memorial Volume
Index entries for linear recurrences with constant coefficients, signature (7,138,112,-256).
FORMULA
a(n) = (1/9)*(2^n + (-1)^n)*(2^(3*n) - (-1)^n) = (1/9)*(4^n - 1)*(8^n - (-1)^n)/(2^n - (-1)^n).
O.g.f.: x*(1 + 28*x + 16*x^2)/((1 - x)*(1 + 2*x)*(1 + 8*x)*(1 - 16*x)).
Recurrence equation: a(n) = 7*a(n-1) + 138*a(n-2) + 112*a(n-4) - 256*a(n-4).
MAPLE
seq(1/9*(2^n + (-1)^n)*(2^(3*n) - (-1)^n), n = 1..20);
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Peter Bala, Mar 01 2014
STATUS
approved