Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #23 Jun 13 2015 00:55:19
%S 0,0,0,0,0,0,0,0,1,0,1,2,4,8,16,32,64,128,256,511,1022,2043,4084,8164,
%T 16320,32624,65216,130368,260608,520960,1041409,2081796,4161549,
%U 8319014,16629864,33243408,66454192,132843168,265555968,530851328,1061181696,2121321983
%N 10-step Fibonacci sequence starting with 0,0,0,0,0,0,0,0,1,0.
%C a(n+10) equals the number of n-length binary words avoiding runs of zeros of lengths 10i+9, (i=0,1,2,...). - _Milan Janjic_, Feb 26 2015
%H <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,1,1,1,1,1,1,1,1).
%F a(n+10) = a(n)+a(n+1)+a(n+2)+a(n+3) +a(n+4)+a(n+5)+a(n+6)+a(n+7) +a(n+8) +a(n+9).
%t LinearRecurrence[Table[1, {10}], {0, 0, 0, 0, 0, 0, 0, 0, 1, 0}, 45] (* _Michael De Vlieger_, Dec 08 2014 *)
%Y Other 10-step Fibonacci sequences are A251760, A251761, A251762, A251763, A251764, A251765, A251766.
%K nonn,easy
%O 0,12
%A _Arie Bos_, Dec 07 2014