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 A210859 #5 Mar 30 2012 18:58:17 %S A210859 1,2,2,3,6,3,4,16,17,5,5,35,62,40,8,6,66,189,206,90,13,7,112,494,822, %T A210859 603,191,21,8,176,1133,2787,3101,1638,393,34,9,261,2337,8255,13209, %U A210859 10483,4175,786,55,10,370,4427,21730,48753,55089,32705,10157,1540 %N A210859 Triangle of coefficients of polynomials v(n,x) jointly generated with A210858; see the Formula section. %C A210859 Row n starts with 1 and ends with F(n+1), where F=A000045 (Fibonacci numbers). %C A210859 Alternating row sums: 1,0,0,0,0,0,0,0,... %C A210859 For a discussion and guide to related arrays, see A208510. %F A210859 u(n,x)=u(n-1,x)+x*v(n-1,x), %F A210859 v(n,x)=(x+n)*u(n-1,x)+x*v(n-1,x), %F A210859 where u(1,x)=1, v(1,x)=1. %e A210859 First five rows: %e A210859 1 %e A210859 2...2 %e A210859 3...6....3 %e A210859 4...16...17...5 %e A210859 5...35...62...40...8 %e A210859 First three polynomials v(n,x): 1, 2 + 2x, 3 + 6x + 3x^2 %t A210859 u[1, x_] := 1; v[1, x_] := 1; z = 14; %t A210859 u[n_, x_] := u[n - 1, x] + x*v[n - 1, x]; %t A210859 v[n_, x_] := (x + n)*u[n - 1, x] + x*v[n - 1, x]; %t A210859 Table[Expand[u[n, x]], {n, 1, z/2}] %t A210859 Table[Expand[v[n, x]], {n, 1, z/2}] %t A210859 cu = Table[CoefficientList[u[n, x], x], {n, 1, z}]; %t A210859 TableForm[cu] %t A210859 Flatten[%] (* A210858 *) %t A210859 cv = Table[CoefficientList[v[n, x], x], {n, 1, z}]; %t A210859 TableForm[cv] %t A210859 Flatten[%] (* A210859 *) %t A210859 Table[u[n, x] /. x -> 1, {n, 1, z}] %t A210859 Table[v[n, x] /. x -> 1, {n, 1, z}] %t A210859 Table[u[n, x] /. x -> -1, {n, 1, z}] %t A210859 Table[v[n, x] /. x -> -1, {n, 1, z}] %Y A210859 Cf. A210858, A208510. %K A210859 nonn,tabl %O A210859 1,2 %A A210859 _Clark Kimberling_, Mar 28 2012