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 A249008 #6 Jul 23 2025 11:50:18 %S A249008 1546,41084,973204,11810564,105819690,589354152,2869206494, %T A249008 10716918348,36428481062,108634995458,299997171280,746679315998, %U A249008 1771285007396,3889902082248,8233803171560,16491148207236,31949943270148 %N A249008 Number of length 7+4 0..n arrays with no five consecutive terms having two times the sum of any three elements equal to three times the sum of the remaining two. %C A249008 Row 7 of A249001 %H A249008 R. H. Hardin, <a href="/A249008/b249008.txt">Table of n, a(n) for n = 1..65</a> %e A249008 Some solutions for n=2 %e A249008 ..0....0....0....0....1....0....0....0....0....1....1....2....0....0....1....2 %e A249008 ..2....0....1....1....2....2....0....1....0....0....0....2....1....2....1....2 %e A249008 ..0....1....1....2....2....2....2....2....0....0....2....1....1....2....1....1 %e A249008 ..2....1....0....0....2....2....0....2....2....1....2....1....2....1....0....2 %e A249008 ..2....0....1....0....2....0....0....2....1....0....2....0....2....2....0....2 %e A249008 ..2....1....0....1....1....2....0....0....1....0....1....0....0....0....1....2 %e A249008 ..1....1....0....0....2....0....1....2....0....2....0....1....1....1....0....1 %e A249008 ..1....1....1....1....1....0....2....2....0....0....1....1....1....0....0....2 %e A249008 ..2....0....0....2....2....2....0....0....0....0....0....2....0....1....0....1 %e A249008 ..1....1....2....0....0....0....1....0....2....0....0....2....1....2....2....0 %e A249008 ..1....1....1....1....2....0....0....2....0....0....0....0....1....0....0....0 %K A249008 nonn %O A249008 1,1 %A A249008 _R. H. Hardin_, Oct 18 2014