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 A212399 #6 Jun 02 2025 07:56:45 %S A212399 638,1150,2104,3872,7143,13185,24322,44794,82294,150686,274744,501524, %T A212399 917116,1679070,3076254,5638155,10334814,18942534,34712677,63595283, %U A212399 116481088,213319856,390670798,715523414,1310607210,2400758159 %N A212399 Number of binary arrays of length n+9 with no more than 5 ones in any length 10 subsequence (=50% duty cycle). %C A212399 Column 5 of A212402 %H A212399 R. H. Hardin, <a href="/A212399/b212399.txt">Table of n, a(n) for n = 1..210</a> %e A212399 Some solutions for n=3 %e A212399 ..1....0....0....0....1....1....1....1....1....1....1....1....1....0....1....0 %e A212399 ..0....0....1....1....0....0....1....0....1....1....1....0....0....0....1....0 %e A212399 ..1....0....0....0....1....0....0....0....0....0....0....0....1....0....0....1 %e A212399 ..0....0....1....1....0....0....1....1....0....0....1....0....0....0....0....0 %e A212399 ..1....0....1....0....0....1....1....0....0....0....0....0....0....0....0....1 %e A212399 ..1....1....1....0....1....0....0....1....1....1....1....0....1....0....0....0 %e A212399 ..0....0....0....0....0....1....0....1....1....0....0....0....0....0....1....0 %e A212399 ..0....1....0....1....0....1....0....0....0....0....0....1....0....0....1....1 %e A212399 ..1....1....1....1....1....0....1....1....1....0....0....1....0....1....0....0 %e A212399 ..0....0....0....1....0....0....0....0....0....1....1....1....0....1....1....1 %e A212399 ..1....1....0....0....1....0....0....1....1....1....0....0....1....0....1....0 %e A212399 ..0....0....1....1....0....0....1....0....1....0....0....1....0....0....1....0 %K A212399 nonn %O A212399 1,1 %A A212399 _R. H. Hardin_ May 14 2012