cp's OEIS Frontend

Denominators of continued fraction convergents to sqrt(3), for n >= 1.

Also denominators of continued fraction convergents to sqrt(3) - 1. See A048788 for numerators. - N. J. A. Sloane, Dec 17 2007. Convergents are 1, 2/3, 3/4, 8/11, 11/15, 30/41, 41/56, 112/153, ...

Consider the mapping f(a/b) = (a + 3*b)/(a + b). Taking a = b = 1 to start with and carrying out this mapping repeatedly on each new (reduced) rational number gives the following sequence 1/1, 2/1, 5/3, 7/4, 19/11, ... converging to 3^(1/2). Sequence contains the denominators. The same mapping for N, i.e., f(a/b) = (a + Nb)/(a + b) gives fractions converging to N^(1/2). - Amarnath Murthy, Mar 22 2003

Sqrt(3) = 2/2 + 2/3 + 2/(3*11) + 2/(11*41) + 2/(41*153) + 2/(153*571), ...; the sum of the first 6 terms of this series = 1.7320490367..., while sqrt(3) = 1.7320508075... - Gary W. Adamson, Dec 15 2007

From Clark Kimberling, Aug 27 2008: (Start)

Related convergents (numerator/denominator):

lower principal convergents: A001834/A001835

upper principal convergents: A001075/A001353

intermediate convergents: A005320/A001075

principal and intermediate convergents: A143642/A140827

lower principal and intermediate convergents: A143643/A005246. (End)

Row sums of triangle A152063 = (1, 3, 4, 11, ...). - Gary W. Adamson, Nov 26 2008

From Alois P. Heinz, Apr 13 2011: (Start)

Also number of domino tilings of the 3 X (n-1) rectangle with upper left corner removed iff n is even. For n=4 the 4 domino tilings of the 3 X 3 rectangle with upper left corner removed are:

. ._. . ._. . ._. . ._.

.|__| .|__| .| | | .|___|

| |_| | | | | | ||| |_| |

||__| |||_| ||__| |_|_| (End)

This is the sequence of Lehmer numbers u_n(sqrt(R),Q) with the parameters R = 2 and Q = -1. It is a strong divisibility sequence, that is, gcd(a(n),a(m)) = a(gcd(n,m)) for all natural numbers n and m. - Peter Bala, Apr 18 2014

2^(-floor(n/2))*(1 + sqrt(3))^n = A002531(n) + a(n)*sqrt(3); integers in the real quadratic number field Q(sqrt(3)). - Wolfdieter Lang, Feb 11 2018

Let T(n) = 2^(n mod 2), U(n) = a(n), V(n) = A002531(n), x(n) = V(n)/U(n). Then T(n*m) * U(n+m) = U(n)*V(m) + U(m)*V(n), T(n*m) * V(n+m) = 3*U(n)*U(m) + V(m)*V(n), x(n+m) = (3 + x(n)*x(m))/(x(n) + x(m)). - Michael Somos, Nov 29 2022

Interspersion of 2 sequences, 2*A054320 and A001079. - Gerry Martens, Jun 10 2015

Numbers k such that 6*k^2 - 2 is a square. - Bruno Berselli, Feb 10 2014

sqrt(3/2) = 1.224744871... = 2/2 + 2/9 + 2/(9*89) + 2/(89*881) + 2/(881*8721) + 2/(8721*86329) + ... - Gary W. Adamson, Oct 08 2008

From Charlie Marion, Jan 07 2009: (Start)

In general, denominators, a(k,n) and numerators, b(k,n), of continued fraction convergents to sqrt((k+1)/k) may be found as follows:

a(k,0) = 1, a(k,1) = 2k;

for n > 0, a(k,2n) = 2*a(k,2n-1)+a(k,2n-2) and a(k,2n+1)=(2k)*a(k,2n)+a(k,2n-1);

b(k,0) = 1, b(k,1) = 2k+1;

for n > 0, b(k,2n) = 2*b(k,2n-1)+b(k,2n-2) and b(k,2n+1)=(2k)*b(k,2n)+b(k,2n-1).

For example, the convergents to sqrt(3/2) start 1/1, 5/4, 11/9, 49/40, 109/89.

In general, if a(k,n) and b(k,n) are the denominators and numerators, respectively, of continued fraction convergents to sqrt((k+1)/k) as defined above, then

k*a(k,2n)^2 - a(k,2n-1)*a(k,2n+1) = k = k*a(k,2n-2)*a(k,2n) - a(k,2n-1)^2 and

b(k,2n-1)*b(k,2n+1) - k*b(k,2n)^2 = k+1 = b(k,2n-1)^2 - k*b(k,2n-2)*b(k,2n);

for example, if k=2 and n=3, then a(2,n)=a(n) and

2*a(2,6)^2 - a(2,5)*a(2,7) = 2*881^2 - 396*3920 = 2;

2*a(2,4)*a(2,6) - a(2,5)^2 = 2*89*881 - 396^2 = 2;

b(2,5)*b(2,7) - 2*b(2,6)^2 = 485*4801 - 2*1079^2 = 3;

b(2,5)^2 - 2*b(2,4)*b(2,6) = 485^2 - 2*109*1079 = 3.

(End)

For n > 0, a(n) equals the permanent of the n X n tridiagonal matrix with the main diagonal alternating sequence [4, 2, 4, 2, 4, ...] and 1's along the superdiagonal and the subdiagonal. - Rogério Serôdio, Apr 01 2018

The a(n) represent the number of n-move routes of a fairy chess piece starting in a given corner square (m = 1, 3, 7 or 9) on a 3 X 3 chessboard. This fairy chess piece behaves like a king on the eight side and corner squares but on the central square the king goes crazy and turns into a red king, see A179596.

The sequence above corresponds to 6 red king vectors, i.e., A[5] vectors, with decimal values 335, 359, 365, 455, 461 and 485. These vectors lead for the side squares to A123347 and for the central square to A179601.

The a(n) represent the number of n-move routes of a fairy chess piece starting in the central square (m = 5) on a 3 X 3 chessboard. This fairy chess piece behaves like a king on the eight side and corner squares but on the central square the king goes crazy and turns into a red king, see A179596.

The sequence above corresponds to 6 red king vectors, i.e., A[5] vectors, with decimal values 335, 359, 365, 455, 461 and 485. These vectors lead for the corner squares to A179600 and for the side squares to A123347.

Suppose that a positive irrational number r has continued fraction [a(0), a(1), ... ]. Define sequences p(i), q(i), P(i), Q(i) from the numerators and denominators of finite continued fractions as follows: p(i)/q(i) = [a(0), a(1), ... a(i)] and P(i)/Q(i) = [a(0), a(1), ..., a(i) + 1]. The fractions p(i)/q(i) are the convergents to r, and the fractions P(i)/Q(i) are introduced here as the "other-side convergents" to r, because p(2k)/q(2k) < r < P(2k)/Q(2k) and P(2k+1)/Q(2k+1) < r < p(2k+1)/q(2k+1), for k >= 0. Closeness of P(i)/Q(i) to r is indicated by

|r - P(i)/Q(i)| < |p(i)/q(i) - P(i)/Q(i)| = 1/(q(i)Q(i)), for i >= 0.

Suppose that a positive irrational number r has continued fraction [a(0), a(1), ... ]. Define sequences p(i), q(i), P(i), Q(i) from the numerators and denominators of finite continued fractions as follows:

p(i)/q(i) = [a(0), a(1), ... a(i)] and P(i)/Q(i) = [a(0), a(1), ..., a(i) + 1]. The fractions p(i)/q(i) are the convergents to r, and the fractions P(i)/Q(i) are introduced here as the "other-side convergents" to r, because p(2k)/q(2k) < r < P(2k)/Q(2k) and P(2k+1)/Q(2k+1) < r < p(2k+1)/q(2k+1), for k >= 0. Closeness of P(i)/Q(i) to r is indicated by

|r - P(i)/Q(i)| < |p(i)/q(i) - P(i)/Q(i)| = 1/(q(i)Q(i)), for i >= 0.