OFFSET
0,3
COMMENTS
The following remarks assume an offset of 1. This is the sequence of Lehmer numbers U_n(sqrt(R),Q) for the parameters R = 36 and Q = -1; it is a strong divisibility sequence, that is, gcd(a(n),a(m)) = a(gcd(n,m)) for all positive integers n and m. Consequently, this is a divisibility sequence: if n divides m then a(n) divides a(m). - Peter Bala, May 28 2014
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..200
Eric W. Weisstein, MathWorld: Lehmer Number
Index entries for linear recurrences with constant coefficients, signature (0,38,0,-1).
FORMULA
G.f.: -(x^2-x-1) / ((x^2-6*x-1)*(x^2+6*x-1)). - Colin Barker, Nov 21 2013
a(n) = 38*a(n-2) - a(n-4) for n > 3. - Vincenzo Librandi, Dec 22 2013
From Peter Bala, May 28 2014: (Start)
The following remarks assume an offset of 1.
Let alpha = 3 + sqrt(10) and beta = 3 - sqrt(10) be the roots of the equation x^2 - 6*x - 1 = 0. Then a(n) = (alpha^n - beta^n)/(alpha - beta) for n odd, while a(n) = (alpha^n - beta^n)/(alpha^2 - beta^2) for n even.
a(n) = Product_{k = 1..floor((n-1)/2)} ( 36 + 4*cos^2(k*Pi/n) ).
Recurrence equations: a(0) = 0, a(1) = 1 and for n >= 1, a(2*n) = a(2*n - 1) + a(2*n - 2) and a(2*n + 1) = 36*a(2*n) + a(2*n - 1). (End)
MATHEMATICA
Denominator[Convergents[Sqrt[360], 30]] (* Vincenzo Librandi, Dec 22 2013 *)
PROG
(Magma) I:=[1, 1, 37, 38]; [n le 4 select I[n] else 38*Self(n-2)-Self(n-4): n in [1..40]]; // Vincenzo Librandi, Dec 22 2013
CROSSREFS
KEYWORD
nonn,frac,easy
AUTHOR
EXTENSIONS
More terms from Colin Barker, Nov 21 2013
STATUS
approved