|
%I #23 Feb 02 2020 07:57:57
%S 1,1,49,50,2449,2499,122401,124900,6117601,6242501,305757649,
%T 312000150,15281764849,15593764999,763782484801,779376249800,
%U 38173842475201,38953218725001,1907928341275249,1946881560000250,95358243221287249,97305124781287499
%N Denominators of continued fraction convergents to sqrt(624).
%C The following remarks assume an offset of 1. This is the sequence of Lehmer numbers U_n(sqrt(R),Q) for the parameters R = 48 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 27 2014
%H Vincenzo Librandi, <a href="/A042199/b042199.txt">Table of n, a(n) for n = 0..100</a>
%H Eric W. Weisstein, <a href="http://mathworld.wolfram.com/LehmerNumber.html">MathWorld: Lehmer Number</a>
%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (0,50,0,-1).
%F G.f.: -(x^2-x-1) / (x^4-50*x^2+1). - _Colin Barker_, Nov 19 2013
%F From _Peter Bala_, May 27 2014: (Start)
%F The following remarks assume an offset of 1.
%F Let alpha = sqrt(12) + sqrt(13) and beta = sqrt(12) - sqrt(13) be the roots of the equation x^2 - sqrt(48)*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.
%F a(n) = Product_{k = 1..floor((n-1)/2)} ( 48 + 4*cos^2(k*Pi/n) ).
%F 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) = 48*a(2*n) + a(2*n - 1). (End)
%t Denominator[Convergents[Sqrt[624],30]] (* _Harvey P. Dale_, Sep 22 2013 *)
%Y Cf. A042198, A040599. A002530.
%K nonn,frac,easy
%O 0,3
%A _N. J. A. Sloane_
%E More terms from _Colin Barker_, Nov 19 2013
|
