The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A221913 Array of coefficients of numerator polynomials (divided by x) of the n-th approximation of the continued fraction x/(1+x/(2+x/(3+... 13
 1, 2, 6, 1, 24, 6, 120, 36, 1, 720, 240, 12, 5040, 1800, 120, 1, 40320, 15120, 1200, 20, 362880, 141120, 12600, 300, 1, 3628800, 1451520, 141120, 4200, 30, 39916800, 16329600, 1693440, 58800, 630, 1, 479001600, 199584000, 21772800, 846720, 11760, 42 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS The row length sequence of this array is 1 + floor((n-1)/2) = A008619(n-1), n >= 1. The array of denominators is found under A084950. The continued fraction 0 + K_{k=1..infinity}(x/k) = x/(1+x/(2+x/(3+... has n-th approximation P(n,x)/Q(n,x). These polynomials satisfy the recurrence q(n,x) = n*q(n-1,x) + x*q(n-2,x), for q replaced by P or Q with inputs P(-1,x) = 1, P(0,x) = 0 and Q(-1,x) = 0 and Q(0,1) = 1. The present array provides the coefficients for Phat(n,x) := P(n,x)/x = sum(a(n,m)*x^m,m=0..floor((n-1)/2)), n >= 1. The recurrence is that of q(n,x) and the inputs are Phat(-1,x) = 1/x and Phat(0,x) =0. For the Q(n,x) coefficients see the companion array A084950. The solution with input q(-1,x) = a and q(0,x) = b is then, due to linearity, q(a,b;n,x) = a*x*Phat(n,x) + b*Q(n,x).  The motivation to consider the q(n,x) recurrence stems from e-mails from Gary Detlefs, who considered integer x and various inputs and gave explicit formulas. This array coincides with the SW-NE diagonals of the coefficient array |A066667| or A105278 (taken with offset [0,0]) of the generalized Laguerre polynomials n!*L(1,n,x) (parameter alpha = 1). The entries a(n,m) have a combinatorial interpretation in terms of certain so-called labeled Morse code polynomials using dots (length 1) and dashes (of length 2). a(n,m) is the number of possibilities to decorate the n-1 positions 2,...,n with m dashes, m from {0,1,...,floor((n-1)/2)}, and n-1-2*m dots. A dot at position k has a label k and each dash between two neighboring positions has a label x.  a(n,m) is the sum of these labeled Morse codes with m dashes after the label x^m has been divided out.  E.g., a(6,2) = 6 + 4 + 2 = 12  from the 3 codes:  dash dash dot, dash dot dash,and  dot dash dash, or (23)(45)6, (23)4(56) and 2(34)(56), and labels (which are in general multiplicative)  6*x^2, 4*x^2 and 2*x^2, respectively. For general Morse code polynomials (Euler's continuants) see the Graham et al. reference given in A221915, p. 302. - Wolfdieter Lang, Feb 28 2013 Row sums Phat(n,1) = A001053(n+1), n >= 1. Alternating row sums  Phat(n,-1) = A058798(n), n >= 1. From Wolfdieter Lang, Mar 06 2013 (Start) The recurrence for q(n,x) given above, can be transformed to the one of Bessel functions given in Abramowitz-Stegun (see A103921 for the reference) in the first line of eq. 9.1.27 on p. 361 via i^n*q(n,x)/sqrt(x)^n = C(n+1,-i*2*sqrt(x)) with the imaginary unit i, where C can stand for BesselJ or BesselY. In order to fix the two inputs for the Q or Phat polynomials (given above) one uses a linear combination of these two independent solutions. The Wronskian eq. 9.1.16, p. 360, is used to simplify the coefficients. One can also use an alternative version based on eqs. 9.6.3 and 9.6.5, p. 375, to trade the J and Y polynomials for I and K.   This produces the two explicit formulas given below, and also the two versions given for Q in A084950. (End) For large order n the behavior of the row polynomials Phat(n,x) (see above) is known from the one of Bessel functions. See a comment on asymptotics under A084950. This leads then to the limit for Phat(n,x)/n! given in the formula section. The limit for the continued fraction mentioned in the name and above is also found in this comment on A084950. - Wolfdieter Lang, Mar 08 2013 This is the unsigned Lah triangle read by ascending antidiagonals. Conversely, reading the given triangle beginning at the left in descending steps yields a row of the unsigned Lah triangle. This can be verified immediately by means of the explicit formulas. For example, [T(5,0), T(6,1), T(7,2), T(8,3), T(9,4)] is row 5 of A105278. - Peter Luschny, Dec 07 2019 LINKS FORMULA Recurrence (short version): a(n,m) = n*a(n-1,m)  + a(n-2,m-1), n>=2, a(1,1) =1, a(n,-1) = 0, a(n,m) = 0 if n < 2*m+1. From the recurrence for the Phat(n,x) polynomials given in a comment above. Recurrence (long version): a(n,m) = 2*(n-1-m)*a(n-1,m) + a(n-2,m-1) - (n-1-m)*(n-2-m)*a(n-2,m), n >= 1, a(1,0) = 1, a(n,-1) = 0, a(n,m) = 0 if  n < 2*m + 1. From the recurrence for the unsigned  generalized Laguerre polynomial with parameter alpha = 1. This recurrence can be simplified to the preceding short version, because the following explicit form follows from the one for the generalized Laguerre coefficients (which, in turn, derives from the Rodrigues formula and the Leibniz rule). This proves the relation a(n,m) = |Lhat(1,n-1-m,m)|, with the coefficients |Lhat(1,n,m)| = |A066667(n,m)|  of the unsigned n!*L(1,n,x) Laguerre polynomials (parameter alpha = 1). a(n,m) = binomial(n-1-m,m)*(n-m)!/(m+1)!, n >= 1, 0 <= m <= floor((n-1)/2). For the e.g.f.s of the column sequences see A105278 (here with different offset, which could be obtained by integration). E.g.f. for row polynomials  gPhat(z,x) := Sum_{z>=0} Phat(n,x)*z^n = Pi*(BesselJ(1, 2*i*sqrt(x)*sqrt(1-z))*BesselY(1, 2*i*sqrt(x)) - BesselY(1, (2*i)*sqrt(x)*sqrt(1-z))*BesselJ(1, 2*i*sqrt(x)))/sqrt(1-z) with Bessel functions and the imaginary unit i = sqrt(-1). Phat(0,x) = 0. From Wolfdieter Lang, Mar 06 2013 (Start) For the row polynomials one finds Phat(n,x) = Pi*(z/2)^n*(BesselY(1,z)* BesselJ(n+1,z) - BesselJ(1,z)*BesselY(n+1,z)) where z := -i*2*sqrt(x) and the i is the imaginary unit. An alternative form is Phat(n,x) = 2*(w/2)^n*(BesselI(1,w)*BesselK(n+1,w) + BesselK(1,w)*BesselI(n+1,w)*(-1)^(n+1)), n >= 1, where w := -2*sqrt(x). See a comment above for the derivation. (End) Lim_{n -> infinity} Phat(n,x)/n! = BesselI(1,2*sqrt(x))/sqrt(x). See a comment above. - Wolfdieter Lang, Mar 08 2013 EXAMPLE The irregular triangle a(n,m)  begins: n\m          0          1         2        3      4    5  6 1:           1 2:           2 3:           6          1 4:          24          6 5:         120         36         1 6:         720        240        12 7:        5040       1800       120        1 8:       40320      15120      1200       20 9:      362880     141120     12600      300     1 10:    3628800    1451520    141120     4200    30 11:   39916800   16329600   1693440    58800    63     1 12:  479001600   19958400  21772800   846720  11760   42 13: 6227020800 2634508800 299376000 12700800 211680 1176  1 ... Recurrence (short version): a(6,1) = 6*36 + 24 = 240. Recurrence (long version): a(6,1) = 2*4*36 + 24 - 4*3*6 = 240. a(6,1) = binomial(4,1)*5!/2! = 4*3*4*5 = 240. MATHEMATICA row[n_] := x/ContinuedFractionK[x, i, {i, 0, n}] // Simplify // Together // Numerator // CoefficientList[#, x]& // Rest; row /@ Range // Flatten (* Jean-François Alcover, Oct 28 2019 *) CROSSREFS Cf. |A066667|, A105278, A084950, A221915. Sequence in context: A008855 A181299 A181365 * A280370 A280980 A281046 Adjacent sequences:  A221910 A221911 A221912 * A221914 A221915 A221916 KEYWORD nonn,tabf,easy AUTHOR Wolfdieter Lang, Feb 23 2013 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 28 02:44 EDT 2020. Contains 337392 sequences. (Running on oeis4.)