OFFSET
1,1
LINKS
Index entries for linear recurrences with constant coefficients, signature (1,0,0,1,-1).
FORMULA
a(n) = 15 + a(n-4); a(n) = - a(1-n).
a(n) = a(n-1) + a(n-4) - a(n-5) for n > 6.
G.f.: x*(x^2 + 3*x + 1)*(2*x^2 - x + 2)/((1 + x)*(1 - x)^2*(1 + x^2)).
a(n)^2 = 15 * A379210(n) + 4.
For n >= 2, a(n-1) + a(n+1) = A072703(n).
It appears that a(n) + a(n+1) = (3/2) * A315211(n).
E.g.f.: (8 - 3*cos(x) + 5*(3*x - 1)*cosh(x) + 3*sin(x) + 5*(3*x - 2)*sinh(x))/4. - Stefano Spezia, Dec 23 2024
Sum_{n>=1} (-1)^(n+1)/a(n) = 2*Pi/(5*sqrt(3)*phi), where phi is the golden ratio (A001622). - Amiram Eldar, Dec 24 2024
MAPLE
a := proc(n) option remember;
`if`(n < 5, [0, 2, 7, 8, 13][n+1], 15 + a(n-4))
end:
seq(a(n), n = 1..70);
MATHEMATICA
LinearRecurrence[{1, 0, 0, 1, -1}, {2, 7, 8, 13, 17}, 70] (* Amiram Eldar, Dec 24 2024 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Peter Bala, Dec 18 2024
STATUS
approved
