This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A210219 #35 Jan 03 2024 06:16:45 %S A210219 1,2,1,3,4,1,4,9,7,1,5,16,22,11,1,6,25,50,46,16,1,7,36,95,130,86,22,1, %T A210219 8,49,161,295,296,148,29,1,9,64,252,581,791,610,239,37,1,10,81,372, %U A210219 1036,1792,1897,1163,367,46,1,11,100,525,1716,3612,4900,4166,2083,541,56,1 %N A210219 Triangle of coefficients of polynomials u(n,x) jointly generated with A210220; see the Formula section. %C A210219 First two terms in row n: n,(n-1)^2; last term: 1. %C A210219 Period of alternating row sums: (1,1,0). %C A210219 For a discussion and guide to related arrays, see A208510. %C A210219 Apparently this is A071920 without the marginal zeros, read by downwards antidiagonals, or T(n,k) = A071922(n,k). - _R. J. Mathar_, May 17 2014 %H A210219 Andrew Howroyd, <a href="/A210219/b210219.txt">Table of n, a(n) for n = 1..1275</a> (rows 1..50) %F A210219 u(n,x) = x*u(n-1,x) + v(n-1,x) + 1, v(n,x) = x*u(n-1,x) + (x+1)*v(n-1,x) + 1, where u(1,x)=1, v(1,x)=1. %F A210219 T(n,k) = Sum_{j=0..floor(k/2)} binomial(k,2*j)*binomial(n-j,k). - _Detlef Meya_, Dec 05 2023 %e A210219 First five rows: %e A210219 1 %e A210219 2...1 %e A210219 3...4....1 %e A210219 4...9....7....1 %e A210219 5...16...22...11...1 %e A210219 First three polynomials u(n,x): 1, 2 + x, 3 + 4x + x^2. %t A210219 u[1, x_] := 1; v[1, x_] := 1; z = 16; %t A210219 u[n_, x_] := x*u[n - 1, x] + v[n - 1, x] + 1; %t A210219 v[n_, x_] := x*u[n - 1, x] + (x + 1)*v[n - 1, x] + 1; %t A210219 Table[Expand[u[n, x]], {n, 1, z/2}] %t A210219 Table[Expand[v[n, x]], {n, 1, z/2}] %t A210219 cu = Table[CoefficientList[u[n, x], x], {n, 1, z}]; %t A210219 TableForm[cu] %t A210219 Flatten[%] (* A210219 *) %t A210219 Table[Expand[v[n, x]], {n, 1, z}] %t A210219 cv = Table[CoefficientList[v[n, x], x], {n, 1, z}]; %t A210219 TableForm[cv] %t A210219 Flatten[%] (* A210220 *) %t A210219 (* alternative program *) %t A210219 T[n_,k_] := Sum[Binomial[k, 2*j]*Binomial[n-j, k], {j, 0, Floor[k/2]}]; Flatten[Table[T[n, k],{n, 1, 11}, {k, 1, n}]] (* _Detlef Meya_, Dec 05 2023 *) %o A210219 (PARI) T(n,k) = sum(j=0, k\2, binomial(k,2*j)*binomial(n-j,k)) \\ _Andrew Howroyd_, Jan 01 2024 %Y A210219 Cf. A210220, A208510, A001906 (row sums). %K A210219 nonn,tabl %O A210219 1,2 %A A210219 _Clark Kimberling_, Mar 19 2012