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 A213463 #6 Jun 02 2025 08:01:41 %S A213463 121573668,422335348,1508740928,5451265872,19808276303,72188618371, %T A213463 263422708979,961420842175,3506529656386,12771245213778, %U A213463 46419273790680,168267481707156,607940940612132,2187698564614622,7835295875376792 %N A213463 Number of 0..3 arrays of length n+13 with sum less than 21 in any length 14 subsequence (=less than 50% duty cycle). %C A213463 Column 7 of A213464 %H A213463 R. H. Hardin, <a href="/A213463/b213463.txt">Table of n, a(n) for n = 1..36</a> %e A213463 Some solutions for n=3 %e A213463 ..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0 %e A213463 ..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0 %e A213463 ..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0 %e A213463 ..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0 %e A213463 ..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0 %e A213463 ..0....0....0....2....2....0....2....2....2....0....0....0....0....2....0....2 %e A213463 ..0....2....0....0....0....0....0....0....0....0....2....2....0....0....2....0 %e A213463 ..2....0....2....0....0....2....2....2....0....0....0....0....2....0....0....0 %e A213463 ..2....0....0....0....2....0....0....2....0....2....0....2....0....0....2....2 %e A213463 ..2....0....0....2....0....0....0....0....0....2....0....2....2....2....0....2 %e A213463 ..2....3....2....3....3....1....2....0....1....0....2....0....1....3....1....1 %e A213463 ..1....1....1....1....2....1....2....3....2....1....3....0....3....0....2....0 %e A213463 ..1....1....1....3....3....1....3....2....0....2....1....3....0....3....0....3 %e A213463 ..0....3....3....0....1....1....1....0....1....3....2....2....2....0....2....0 %e A213463 ..2....0....1....3....0....3....0....3....0....3....0....2....0....0....2....0 %e A213463 ..0....3....2....2....3....0....1....3....1....2....2....3....3....2....2....1 %K A213463 nonn %O A213463 1,1 %A A213463 _R. H. Hardin_ Jun 12 2012