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 A199708 #12 Jul 22 2025 13:23:12 %S A199708 32,708,4964,20116,59992,147072,314532,608420,1089752,1836600,2946204, %T A199708 4537152,6751384,9756388,13747296,18948952,25618064,34045344,44557532, %U A199708 57519592,73336788,92456792,115371796,142620672,174790996,212521224 %N A199708 Number of -n..n arrays x(0..5) of 6 elements with zero sum and no two neighbors equal. %C A199708 Row 6 of A199704 %H A199708 R. H. Hardin, <a href="/A199708/b199708.txt">Table of n, a(n) for n = 1..200</a> %F A199708 Empirical: a(n)=3*a(n-1)-2*a(n-2)-a(n-3)+2*a(n-5)-a(n-6)-a(n-7)+2*a(n-8)-a(n-10)-2*a(n-11)+3*a(n-12)-a(n-13) %e A199708 Some solutions for n=5 %e A199708 ..5....0....0....1....1....2...-2....5....0....2...-1...-1....0....0...-5...-4 %e A199708 ..0...-3....1...-5...-1...-2....5....1...-5....1....1....2....4....4....5...-1 %e A199708 .-1....5....3....4....1....4...-1...-4....1....2...-2...-5....0....1...-3....1 %e A199708 .-5....2...-1....2....3...-1....1...-2....5...-5....5....5...-1...-3....1....2 %e A199708 ..0...-1....1...-2...-4...-3...-4...-4...-3...-4....0....0....2...-4....4....3 %e A199708 ..1...-3...-4....0....0....0....1....4....2....4...-3...-1...-5....2...-2...-1 %K A199708 nonn %O A199708 1,1 %A A199708 _R. H. Hardin_ Nov 09 2011