cp's OEIS Frontend

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.

A200167 Number of -n..n arrays x(0..3) of 4 elements with nonzero sum and with zero through 3 differences all nonzero.

This page as a plain text file.
%I A200167 #7 Jun 07 2023 20:08:07
%S A200167 0,76,576,2256,6160,13888,27160,48380,80096,125412,187552,270688,
%T A200167 378512,515980,687836,899548,1156496,1465440,1832040,2263800,2767676,
%U A200167 3351476,4022752,4790848,5663388,6650440,7761148,9005676,10393744,11937276
%N A200167 Number of -n..n arrays x(0..3) of 4 elements with nonzero sum and with zero through 3 differences all nonzero.
%C A200167 Row 4 of A200165.
%H A200167 R. H. Hardin, <a href="/A200167/b200167.txt">Table of n, a(n) for n = 1..200</a>
%F A200167 Empirical: a(n) = 2*a(n-2) +2*a(n-3) -a(n-4) -3*a(n-5) -a(n-6) +a(n-9) +3*a(n-10) +a(n-11) -2*a(n-12) -2*a(n-13) +a(n-15).
%e A200167 Some solutions for n=5
%e A200167 .-1...-5...-1...-3....3...-4...-1....3...-4....3....5...-2...-5...-4....5....1
%e A200167 ..4....4....5....4...-2....4....3...-4....5....1...-1...-5...-2...-3...-3....5
%e A200167 ..1....5...-2....2....2...-5....4...-1....1....3....1...-1....2....4...-2....2
%e A200167 ..3....4....4...-2....1....1...-5....5....4...-4....5....1...-3....5...-5...-2
%Y A200167 Cf. A200165.
%K A200167 nonn
%O A200167 1,2
%A A200167 _R. H. Hardin_, Nov 13 2011