|
%I #22 Jun 13 2015 00:55:18
%S 0,0,0,0,1,0,1,2,4,8,16,31,62,123,244,484,960,1904,3777,7492,14861,
%T 29478,58472,115984,230064,456351,905210,1795559,3561640,7064808,
%U 14013632,27797200,55138049,109370888,216946217,430330794,853596780,1693179928,3358562656
%N 6-step Fibonacci sequence starting with (0,0,0,0,1,0).
%C a(n+6) equals the number of n-length binary words avoiding runs of zeros of lengths 6i+5, (i=0,1,2,...). - _Milan Janjic_, Feb 26 2015
%H <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,1,1,1,1)
%F a(n+6) = a(n) + a(n+1) + a(n+2) + a(n+3) + a(n+4) + a(n+5).
%t LinearRecurrence[Table[1, {6}], {0, 0, 0, 0, 1, 0}, 40] (* _Michael De Vlieger_, Dec 09 2014 *)
%Y Other 6-step Fibonacci sequences are A001592, A074584, A251706, A251707, A251708, A251709.
%K nonn,easy
%O 0,8
%A _Arie Bos_, Dec 07 2014
|
