OFFSET
0,1
COMMENTS
LINKS
Index entries for linear recurrences with constant coefficients, signature (-4,0,4,1).
FORMULA
Properties (from Creighton Dement, Sep 06 2004):
I: jes(n) + les(n) + tes(n) = ves(n)
II: All of the following are perfect squares: {les(2n+1); tes(2n+1); ves(2n+1); ves(2n+1) - jes(2n+1) - 1 = les(2n+1) + tes(2n+1) - 1; 3*les(2n+1) + 1 = 3*jes(n)^2 + 1}.
III: les(2n+1) divides ves(2n+1) - jes(2n+1) - 1 = les(2n+1) + tes(2n+1) - 1
IV: (jes(n))^2 = les(2n+1)
VI: sqrt( ves(2n+1) ) = A001835(n)
VII: sqrt( les(2n+1) ) = A001353(n)
VIII: les(n) + tes(n) = ves(2+n) + jes(n)
IX: lim n |jes(n+1)/jes(n)| = lim n |les(n+1)/les(n)| = lim n |tes(n+1)/tes(n)| = lim n |ves(n+1)/ves(n)| = 2 + sqrt(3)
Comment from Roland Bacher, Sep 07 2004: These 4 sequences satisfy jes(n+1)=-4*jes(n)-jes(n-1), les(n+1)=les(n-1)+jes(n), ves(n+1)=les(n-1)-jes(n-1)+tes(n-1), tes(n+1)=les(n-1)+3*jes(n), plus initial conditions for n=0, 1.
12*a(n) = -11 -9*(-1)^n -2*(-1)^n*A001075(n+1). - R. J. Mathar, May 21 2019
From Eric Simon Jacob, Aug 26 2023: (Start)
a(n) = ( ( sqrt(3) - 2 )^(n+1) + ( -sqrt(3) - 2 )^(n+1) + 9*(-1)^(n+1) - 11 )/12.
a(n) = ( 2*cosh( (n+1)*log(sqrt(3) - 2) ) + 9*(-1)^(n+1) - 11 )/12. (End)
MATHEMATICA
LinearRecurrence[{-4, 0, 4, 1}, {-2, 1, -6, 16}, 27] (* Robert P. P. McKone, Aug 25 2023 *)
CROSSREFS
KEYWORD
sign,easy
AUTHOR
N. J. A. Sloane, following a suggestion of Creighton Dement, Sep 06 2004
STATUS
approved