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 A213461 #6 Jun 02 2025 08:01:27 %S A213461 466136,1568984,5444644,19105020,67329406,237475982,836356119, %T A213461 2935825527,10254646515,35582811585,122434373801,422379318044, %U A213461 1462308785872,5075439138225,17643670747421,61385086115242,213624545918282 %N A213461 Number of 0..3 arrays of length n+9 with sum less than 15 in any length 10 subsequence (=less than 50% duty cycle). %C A213461 Column 5 of A213464 %H A213461 R. H. Hardin, <a href="/A213461/b213461.txt">Table of n, a(n) for n = 1..61</a> %e A213461 Some solutions for n=3 %e A213461 ..0....0....2....2....0....2....0....2....0....2....2....2....0....0....0....0 %e A213461 ..0....0....0....0....2....0....0....0....2....2....2....0....0....2....2....2 %e A213461 ..0....2....0....2....0....0....0....2....2....2....0....0....2....0....2....2 %e A213461 ..0....0....2....2....2....2....2....0....2....0....2....2....0....0....0....2 %e A213461 ..2....2....0....0....2....2....2....0....2....2....0....2....2....0....2....0 %e A213461 ..0....0....0....0....0....2....0....2....0....2....0....0....0....0....0....2 %e A213461 ..1....0....0....2....0....0....0....0....2....2....0....2....0....0....2....0 %e A213461 ..2....1....3....1....3....3....0....2....1....0....1....2....2....2....0....0 %e A213461 ..1....1....2....0....1....0....3....2....0....1....0....1....3....3....3....1 %e A213461 ..2....2....0....1....3....0....1....1....1....0....3....1....0....2....1....2 %e A213461 ..3....1....1....3....1....2....3....0....1....0....0....0....2....0....2....3 %e A213461 ..1....2....2....0....2....3....3....0....1....1....1....3....3....2....2....2 %K A213461 nonn %O A213461 1,1 %A A213461 _R. H. Hardin_ Jun 12 2012