OFFSET
1,1
COMMENTS
REFERENCES
Leonard Eugene Dickson, History of the Theory of Numbers, Vol. II, Diophantine Analysis, AMS Chelsea Publishing, Providence, Rhode Island, 1999, pp. 341-400.
LINKS
Vladimir Pletser, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (0,6,0,-1).
FORMULA
a(n) = a(n-1) + 4*A156066(n-1) + (-1)^(n-1)*(A048655(n-2) + A048655(n-3)) for n > 1 and with A048655(-1) = 3.
a(n) = 6*a(n-2) - a(n-4) with a(1) = 3, a(2) = 7, a(3) = 25, a(4) = 45.
a(n)*a(n+3) - a(n+1)*a(n+2) = -2*(34 + 14*(-1)^n).
a(n) = 2*A154138(n) + 1.
G.f.: x * (x+1) * (3*x^2+4*x+3) / ((x^2-2*x-1) * (x^2+2*x- 1)). - Elmo R. Oliveira, Apr 03 2026
EXAMPLE
a(1) = 3 because 3^2 + 23 = 32 = 2*4^2.
MATHEMATICA
LinearRecurrence[{0, 6, 0, -1}, {3, 7, 25, 45}, 30] (* Paolo Xausa, Sep 09 2025 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Vladimir Pletser, Sep 01 2025
STATUS
approved
