|
%I #15 Feb 05 2023 09:22:38
%S 1,-2,2,0,-2,-12,12,4,-4,0,4,-24,-264,576,-288,-8,8,0,-8,-144,1872,
%T 10368,-39744,41472,-13824,16,-16
%N A triangular sequence from coefficients of a mixed type of three deep polynomial recursion: Q(x, n) = 6*x*Q(x, n - 2)*Q(x, n - 3) - 2*Q(x, n - 3).
%C R
%D Henry McKean and Victor Moll, Elliptic Curves, Function Theory, Geometry, Arithmetic, Cambridge University Press, New York, 1997, page 91.
%F Q(x, n) = 6*x*Q(x, n - 2)*Q(x, n - 3) - 2*Q(x, n - 3).
%e {1},
%e {-2, 2},
%e {0},
%e {-2, -12, 12},
%e {4, -4},
%e {0},
%e {4, -24, -264, 576, -288},
%e {-8, 8},
%e {0},
%e {-8, -144, 1872, 10368, -39744, 41472, -13824},
%e {16, -16}
%t Q[x, -2] = 1 - x; Q[x, -1] = 0; Q[x, 0] = 1;
%t Q[x_, n_] := Q[x, n] = 6*x*Q[x, n - 2]*Q[x, n - 3] - 2*Q[x, n - 3]
%t Table[ExpandAll[Q[x, n]], {n, 0, 10}]
%t a = Table[CoefficientList[Q[x, n], x], {n, 0, 10}] (* here I had to add {0} for null {} to get a representation*)
%t Flatten[{{1}, {-2, 2}, {0}, {-2, -12, 12}, {4, -4}, {0}, {4, -24, -264, 576, -288}, {-8, 8}, {0}, {-8, -144, 1872, 10368, -39744, 41472, -13824}, {16, -16}}]
%K uned,tabf,sign
%O 1,2
%A _Roger L. Bagula_, Apr 08 2008
|
