cp's OEIS Frontend

A230001 Triangular array read by rows: row n shows the coefficients of the polynomial v(n) = d(0) + d(1)*x + ... + d(k)*x^k which is the denominator of the n-th convergent of the continued fraction [1, 1/x, 1/x^2, ... ,1/x^n].

%I A230001 #7 Aug 05 2014 09:20:44
%S A230001 1,1,1,0,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0,1,0,0,1,1,0,0,1,0,1,0,1,0,1,1,
%T A230001 0,1,0,1,1,0,0,1,0,1,0,1,0,1,1,1,1,0,2,0,1,0,1,0,0,1,1,0,0,1,0,1,0,1,
%U A230001 0,1,1,1,1,1,2,0,2,0,2,0,1,1,1,1,0,1
%N A230001 Triangular array read by rows: row n shows the coefficients of the polynomial v(n) = d(0) + d(1)*x + ... + d(k)*x^k which is the denominator of the n-th convergent of the continued fraction [1, 1/x, 1/x^2, ... ,1/x^n].
%C A230001 In the Name section, k = n(n+1)/2 if n is even, and k = (n-1)(n+2)/2 if n is odd.  For the numerator polynomials, see A230000.  Conjecture:  every nonnegative integer occurs infinitely many times.
%F A230001 Write the numerator polynomials as u(0), u(1), u(2), ... and the denominator polynomials as v(0), v(1), v(2),...  Let p(0) = 1, q(0) = 1; p(1) = (1 + x)/x; q(1) = 1/x; p(n ) = p(n-1)/x^n + p(n-2), q(n) = q(n-1)/x^n + q(n-2).  Then u(n)/v(n) = p(n)/q(n) for n>=0.
%e A230001 The first 7 rows:
%e A230001 1 . . . . . . . . . . . . polynomial v(0) = 1
%e A230001 1 . . . . . . . . . . . . polynomial v(1) = 1
%e A230001 1 0 0 1 . . . . . . . . . v(2) = 1 + x^3
%e A230001 1 0 0 1 0 1 . . . . . . . v(3) = 1 + x^3 + x^5
%e A230001 1 0 0 1 0 1 0 1 0 0 1
%e A230001 1 0 0 1 0 1 0 1 0 1 1 0 1 0 1
%t A230001 t[n_] := t[n] = Table[1/x^k, {k, 0, n}];
%t A230001 b = Table[Factor[Denominator[t[n]]], {n, 0, 10}];
%t A230001 p[x_, n_] := p[x, n] = Last[Expand[Numerator[b]]][[n]];
%t A230001 u = Table[p[x, n], {n, 1, 10}]
%t A230001 v = CoefficientList[u, x]
%t A230001 Flatten[v]
%Y A230001 Cf. A230000.
%K A230001 nonn,tabf
%O A230001 0,53
%A A230001 _Clark Kimberling_, Oct 11 2013