|
%I #8 Mar 12 2014 16:36:59
%S 1,-1,1,0,-2,1,2,2,-4,1,-6,2,11,-7,1,22,-24,-37,42,-12,1,-146,204,217,
%T -338,133,-20,1,1766,-2654,-2395,4359,-1995,387,-33,1,-36064,56072,
%U 46122,-91568,45323,-9982,1073,-54,1,1212048,-1921280,-1492916,3124562,-1616590,381615,-46200,2901,-88,1,-66338064
%N Triangular array read by rows: row n gives coefficients of p(n)(x), where p(0)=1, p(1)=x-1, p(n) = (x-fibonacci(n))*p(n-1)-(n-1)*p(n-2).
%e {1},
%e {-1, 1},
%e {0, -2, 1},
%e {2, 2, -4, 1},
%e {-6, 2, 11, -7, 1},
%e {22, -24, -37, 42, -12, 1},
%e {-146, 204, 217, -338, 133, -20,1},
%e {1766, -2654, -2395, 4359, -1995, 387, -33, 1},
%e {-36064, 56072, 46122, -91568, 45323, -9982, 1073, -54, 1},
%e {1212048, -1921280, -1492916, 3124562, -1616590, 381615, -46200, 2901, -88, 1},
%p p:=proc(n) option remember; if n = 0 then RETURN(1); fi; if n = 1 then RETURN(x-1); fi; sort(expand((x-fibonacci(n))*p(n-1)-(n-1)*p(n-2))); end; (_N. J. A. Sloane_)
%K tabl,sign
%O 0,5
%A _Roger L. Bagula_, Oct 23 2006
%E Edited by _N. J. A. Sloane_, Oct 24 2006
|
