|
| |
|
|
A041311
|
|
Denominators of continued fraction convergents to sqrt(168).
|
|
2
|
|
|
|
1, 1, 25, 26, 649, 675, 16849, 17524, 437425, 454949, 11356201, 11811150, 294823801, 306634951, 7654062625, 7960697576, 198710804449, 206671502025, 5158826853049, 5365498355074, 133930787374825, 139296285729899, 3477041644892401, 3616337930622300
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
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 = 24 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
|
|
|
|
FORMULA
|
G.f.: -(x^2-x-1) / (x^4-26*x^2+1). - Colin Barker, Nov 15 2013
The following remarks assume an offset of 1.
Let alpha = sqrt(6) + sqrt(7) and beta = sqrt(6) - sqrt(7) be the roots of the equation x^2 - sqrt(24)*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)} ( 24 + 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) = 24*a(2*n) + a(2*n - 1). (End)
|
|
|
MATHEMATICA
|
|
|
|
PROG
|
(Magma) I:=[1, 1, 25, 26]; [n le 4 select I[n] else 26*Self(n-2)-Self(n-4): n in [1..40]]; // Vincenzo Librandi, Dec 15 2013
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,frac,easy
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
|
