|
%I #28 Feb 03 2022 12:48:23
%S 1,1,1,1,4,1,1,9,6,1,1,16,20,8,1,1,25,50,35,10,1,1,36,105,112,54,12,1,
%T 1,49,196,294,210,77,14,1,1,64,336,672,660,352,104,16,1,1,81,540,1386,
%U 1782,1287,546,135,18,1,1,100,825,2640,4290,4004,2275,800,170,20,1
%N Triangle of coefficients of polynomials u(n,x) jointly generated with A111125; see the Formula section.
%C The columns of A208513 are identical to those of A208509. Here, however, the alternating row sums are periodic (with period 1,0,-2,-3,-2,0).
%C From _Tom Copeland_, Nov 07 2015: (Start)
%C These polynomials may be expressed in terms of the Faber polynomials of A263916, similar to A127677.
%C Rephrasing notes in A111125: Append an initial column of zeros except for a 1 at the top to A111125. Then the rows of this entry contain the partial sums of the column sequences of modified A111125; therefore, the difference of consecutive pairs of rows of this entry, modified by appending an initial row of zeros to it, generates the modified A111125. (End)
%H G. C. Greubel, <a href="/A208513/b208513.txt">Rows n = 1..50 of the triangle, flattened</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Morgan-VoycePolynomials.html">Morgan-Voyce polynomials</a>
%F Coefficients of u(n, x) from the mixed recurrence relations:
%F u(n,x) = u(n-1,x) + x*v(n-1,x),
%F v(n,x) = u(n-1,x) + (x+1)*v(n-1,x) + 1,
%F where u(1,x) = 1, u(2,x) = 1+x, v(1,x) = 1, v(2,x) = 3+x.
%F From _Peter Bala_, May 01 2012: (Start)
%F Working with an offset of 0: T(n,0) = 1; T(n,k) = (n/k)*binomial(n+k-1,2*k-1) = (n/k)*A078812(n,k) for k > 0. Cf. A156308.
%F O.g.f.: ((1-t)^2 + t^2*x)/((1-t)*((1-t)^2-t*x)) = 1 + (1+x)*t + (1+4*x+x^2)*t^2 + ....
%F u(n+1,x) = -1 + (b(2*n,x) + 1)/b(n,x), where b(n,x) = Sum_{k = 0..n} binomial(n+k, 2*k)*x^k are the Morgan-Voyce polynomials of A085478.
%F This triangle is formed from the even numbered rows of A211956 with a factor of 2^(k-1) removed from the k-th column entries.
%F (End)
%F T(n, k) = (2*(n-1)/(n+k-2))*binomial(n+k-2, 2*k-2). - _G. C. Greubel_, Feb 02 2022
%e First five rows:
%e 1;
%e 1, 1;
%e 1, 4, 1;
%e 1, 9, 6, 1;
%e 1, 16, 20, 8, 1;
%e First five polynomials u(n,x):
%e u(1,x) = 1;
%e u(2,x) = 1 + x;
%e u(3,x) = 1 + 4*x + x^2;
%e u(4,x) = 1 + 9*x + 6*x^2 + x^3;
%e u(5,x) = 1 + 16*x + 20*x^2 + 8*x^3 + x^4;
%t (* First program *)
%t u[1, x_]:=1; v[1, x_]:=1; z=16;
%t u[n_, x_]:= u[n-1, x] + x*v[n-1, x];
%t v[n_, x_]:= u[n-1, x] + (x+1)*v[n-1, x] + 1;
%t Table[Expand[u[n, x]], {n, 1, z/2}]
%t Table[Expand[v[n, x]], {n, 1, z/2}]
%t cu = Table[CoefficientList[u[n, x], x], {n,z}];
%t TableForm[cu]
%t Flatten[%] (* A208513 *)
%t Table[Expand[v[n, x]], {n,z}]
%t cv = Table[CoefficientList[v[n, x], x], {n,z}];
%t TableForm[cv]
%t Flatten[%] (* A111125 *)
%t (* Second program *)
%t T[n_, k_]:= If[k==1, 1, ((n-1)/(k-1))*Binomial[n+k-3, 2*k-3]];
%t Table[T[n, k], {n,15}, {k,n}]//Flatten (* _G. C. Greubel_, Feb 02 2022 *)
%o (Magma)
%o A208513:= func< n,k | k eq 1 select 1 else (2*(n-1)/(n+k-2))*Binomial(n+k-2, 2*k-2) >;
%o [A208513(n,k): k in [1..n], n in [1..12]]; // _G. C. Greubel_, Feb 02 2022
%o (Sage)
%o def A208513(n,k): return 1 if (k==1) else ((n-1)/(k-1))*binomial(n+k-3, 2*k-3)
%o flatten([[A208513(n,k) for k in (1..n)] for n in (1..12)]) # _G. C. Greubel_, Feb 02 2022
%Y Cf. A085478, A078812, A111125, A156308, A208509, A211956.
%Y Cf. A127677, A263916.
%K nonn,tabl
%O 1,5
%A _Clark Kimberling_, Feb 28 2012
|
