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 A249288 #6 Jul 23 2025 11:57:59 %S A249288 2070,12600,76856,469072,2863158,17477172,106687006,651265876, %T A249288 3975630136,24269116850,148150208272,904379542250,5520764471064, %U A249288 33701382275398,205729331323368,1255870097060206,7666430906270386,46799555928424622 %N A249288 Number of length n+3 0..6 arrays with no four consecutive terms having the sum of any three elements equal to three times the fourth. %C A249288 Column 6 of A249290 %H A249288 R. H. Hardin, <a href="/A249288/b249288.txt">Table of n, a(n) for n = 1..210</a> %e A249288 Some solutions for n=3 %e A249288 ..3....4....2....5....2....2....5....0....1....5....3....2....0....4....4....0 %e A249288 ..2....5....5....2....4....1....1....3....2....0....0....4....4....4....3....6 %e A249288 ..4....3....5....5....2....2....0....1....2....1....4....0....4....1....4....6 %e A249288 ..1....1....1....0....3....1....5....6....1....1....3....1....6....2....6....2 %e A249288 ..5....2....2....3....4....3....4....3....6....4....4....6....6....4....5....3 %e A249288 ..3....4....3....6....4....0....0....5....0....5....6....5....1....4....3....3 %K A249288 nonn %O A249288 1,1 %A A249288 _R. H. Hardin_, Oct 24 2014