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 A212229 #6 Jun 02 2025 07:55:36 %S A212229 34001,89911,242780,660796,1804448,4931630,13468524,36711516,99762134, %T A212229 269986256,726810250,1959270880,5292416365,14316932524,38765529832, %U A212229 105016326560,284539410032,770899685027,2088100303095,5654125322731 %N A212229 Number of 0..2 arrays of length n+9 with sum no more than 10 in any length 10 subsequence (=50% duty cycle). %C A212229 Column 5 of A212232 %H A212229 R. H. Hardin, <a href="/A212229/b212229.txt">Table of n, a(n) for n = 1..210</a> %e A212229 Some solutions for n=3 %e A212229 ..0....0....0....0....0....0....0....1....0....1....0....0....0....0....0....0 %e A212229 ..1....0....0....1....0....2....0....0....0....0....0....0....0....0....2....1 %e A212229 ..0....1....2....2....0....0....0....0....0....0....2....0....0....0....0....2 %e A212229 ..1....1....0....1....0....1....2....0....0....1....2....2....1....1....2....0 %e A212229 ..2....1....1....0....0....0....2....0....1....1....2....2....2....1....0....0 %e A212229 ..0....0....0....1....2....2....1....1....2....1....0....0....1....0....2....2 %e A212229 ..0....0....0....1....0....2....0....2....1....0....0....1....0....0....2....1 %e A212229 ..2....1....1....1....1....2....2....0....1....1....0....0....1....1....2....0 %e A212229 ..2....0....0....0....0....0....0....1....1....0....2....1....2....1....0....0 %e A212229 ..0....0....2....2....2....0....0....1....1....1....1....2....1....0....0....2 %e A212229 ..2....0....1....1....2....0....0....1....0....0....1....1....0....1....0....0 %e A212229 ..1....1....2....1....1....1....1....0....1....0....0....0....2....2....0....2 %K A212229 nonn %O A212229 1,1 %A A212229 _R. H. Hardin_ May 06 2012