|
%I #16 Jun 13 2015 00:48:54
%S 21,408,23184,2298912,274767936,34561392768,4404491583744,
%T 563156132823552,72064191275467776,9223583144429488128,
%U 1180598376127589781504,151115943624696659976192,19342820031363781631164416,2475880299931694931871039488
%N a(n) = 8th Fibonacci polynomial evaluated at 2^n.
%H Colin Barker, <a href="/A020534/b020534.txt">Table of n, a(n) for n = 0..474</a>
%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (170,-5712,43520,-65536).
%F G.f.: -3*(75264*x^3-24592*x^2+1054*x-7) / ((2*x-1)*(8*x-1)*(32*x-1)*(128*x-1)). - _Colin Barker_, May 03 2015
%p with(combinat,fibonacci):seq(fibonacci(8,2^i),i=0..24);
%t Table[Fibonacci[8,2^i],{i,0,30}] (* _Vladimir Joseph Stephan Orlovsky_, Nov 03 2009 *)
%o (PARI) Vec(-3*(75264*x^3-24592*x^2+1054*x-7)/((2*x-1)*(8*x-1)*(32*x-1)*(128*x-1)) + O(x^100)) \\ _Colin Barker_, May 03 2015
%K nonn,easy
%O 0,1
%A _Simon Plouffe_
|
