|
%I #17 Jun 13 2015 00:48:54
%S 13,169,5473,283009,17106433,1078990849,68803387393,4399388786689,
%T 281496451940353,18014742108438529,1152927002171277313,
%U 73787064255793594369,4722367890244629430273,302231477421655833182209,19342813474122038595551233,1237940045049987804375810049
%N a(n) = 7th Fibonacci polynomial evaluated at 2^n.
%H Colin Barker, <a href="/A020533/b020533.txt">Table of n, a(n) for n = 0..553</a>
%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (85,-1428,5440,-4096).
%F a(n) = 1+3*2^(1+2*n)+5*16^n+64^n. - _Colin Barker_, May 03 2015
%F G.f.: -(11584*x^3-9672*x^2+936*x-13) / ((x-1)*(4*x-1)*(16*x-1)*(64*x-1)). - _Colin Barker_, May 03 2015
%p with(combinat,fibonacci):seq(fibonacci(7,2^i),i=0..24);
%t Table[Fibonacci[7,2^i],{i,0,30}] (* _Vladimir Joseph Stephan Orlovsky_, Nov 03 2009 *)
%o (PARI) Vec(-(11584*x^3-9672*x^2+936*x-13)/((x-1)*(4*x-1)*(16*x-1)*(64*x-1)) + O(x^100)) \\ _Colin Barker_, May 03 2015
%K nonn,easy
%O 0,1
%A _Simon Plouffe_
|
