This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A255378 #13 Mar 26 2022 19:50:16
%S A255378 0,0,0,0,0,0,0,0,1,18,261,3420,42300,504000,5850000,66600000,
%T A255378 747000000,8279999991,90899999757,989999995383,10709999925399,
%U A255378 115199998904070,1232999984885400,13139999800740000,139499997460650000,1475999968482900000,15569999617032000081
%N A255378 Number of strings of n decimal digits that contain at least one string of exactly 8 consecutive "0" digits.
%H A255378 <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (20,-100,0,0,0,0,0,0,-9,99,-90).
%F A255378 a(0) = a(1) = ... = a(7) = 0, a(8) = 1, a(n) = 9*(10^(n-9) - a(n-9) + sum_{i=8..n-1} a(i)) for n>=9.
%F A255378 G.f.: x^8*(x-1)^2/((10*x-1)*(9*x^10-9*x^9+10*x-1)). - _Alois P. Heinz_, Feb 26 2015
%t A255378 LinearRecurrence[{20,-100,0,0,0,0,0,0,-9,99,-90},{0,0,0,0,0,0,0,0,1,18,261},30] (* _Harvey P. Dale_, Mar 26 2022 *)
%Y A255378 Cf. A255371-A255377 (for the k=1 through k=7 cases of "exactly k consecutive '0' digits"), A255379 and A255380 (for the cases k=9 and k=10).
%K A255378 nonn,base,easy
%O A255378 0,10
%A A255378 _Jon E. Schoenfield_, Feb 22 2015