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 A249293 #6 Jul 23 2025 11:58:19 %S A249293 48,428,2144,9504,29100,76856,178644,374540,723300,1314744,2258528, %T A249293 3717444,5893024,9039940,13477788,19618656,27921268,38978528,53474096, %U A249293 72214004,96133160,126348344,164077052,210790324,268108160,337868944 %N A249293 Number of length 3+3 0..n arrays with no four consecutive terms having the sum of any three elements equal to three times the fourth. %C A249293 Row 3 of A249290 %H A249293 R. H. Hardin, <a href="/A249293/b249293.txt">Table of n, a(n) for n = 1..210</a> %e A249293 Some solutions for n=7 %e A249293 ..6....2....4....0....0....4....2....6....4....6....0....2....2....1....2....0 %e A249293 ..6....5....0....4....1....5....6....2....2....0....6....7....2....2....7....4 %e A249293 ..1....5....1....3....0....2....5....3....7....0....2....6....1....2....7....1 %e A249293 ..7....5....2....3....1....6....1....3....7....0....1....1....0....6....1....5 %e A249293 ..5....1....7....1....1....2....3....2....0....2....4....3....4....3....3....2 %e A249293 ..3....3....1....2....4....6....5....6....3....3....6....7....2....3....2....2 %K A249293 nonn %O A249293 1,1 %A A249293 _R. H. Hardin_, Oct 24 2014