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 A213115 #6 Jun 02 2025 08:00:32 %S A213115 386,646,1110,1926,3354,5842,10154,17578,30256,51692,87508,148556, %T A213115 253348,433455,743027,1274970,2188430,3755600,6441345,11038715, %U A213115 18900654,32346074,55355775,94759703,162266073,277937560,476145196,815757624 %N A213115 Number of binary arrays of length n+9 with fewer than 5 ones in any length 10 subsequence (=less than 50% duty cycle). %C A213115 Column 5 of A213118 %H A213115 R. H. Hardin, <a href="/A213115/b213115.txt">Table of n, a(n) for n = 1..210</a> %e A213115 Some solutions for n=3 %e A213115 ..1....1....0....0....1....0....0....0....1....1....0....1....1....0....0....1 %e A213115 ..0....1....0....1....1....1....0....1....1....0....1....0....0....0....1....0 %e A213115 ..0....1....0....0....0....0....0....0....0....0....1....0....0....0....0....0 %e A213115 ..0....0....0....0....0....0....0....0....0....0....1....1....0....0....0....1 %e A213115 ..0....0....1....0....0....0....0....0....0....0....0....0....0....1....1....0 %e A213115 ..0....1....0....0....0....0....1....1....1....0....0....1....0....0....1....0 %e A213115 ..1....0....0....0....1....0....1....0....1....1....1....1....1....0....0....1 %e A213115 ..0....0....0....0....0....0....0....0....0....0....0....0....1....0....0....1 %e A213115 ..0....0....1....1....1....0....1....0....0....1....0....0....0....1....0....0 %e A213115 ..0....0....0....1....0....0....0....1....0....1....0....0....0....1....0....0 %e A213115 ..1....1....1....1....1....0....1....1....1....1....0....1....0....1....1....1 %e A213115 ..1....1....0....0....0....1....0....1....1....0....0....0....0....0....1....0 %K A213115 nonn %O A213115 1,1 %A A213115 _R. H. Hardin_ Jun 05 2012