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.

A199905 Number of -4..4 arrays x(0..n-1) of n elements with zero sum, and adjacent elements not equal modulo three (with -1 modulo 3 = 2).

This page as a plain text file.
%I A199905 #7 Jun 22 2021 14:21:34
%S A199905 1,6,42,152,804,5016,24864,139148,814776,4509164,25781576,149525280,
%T A199905 856571710,4954153908,28801991844,167153096856,973462118580,
%U A199905 5682734337828,33191217303840,194193233863080,1137757795417530
%N A199905 Number of -4..4 arrays x(0..n-1) of n elements with zero sum, and adjacent elements not equal modulo three (with -1 modulo 3 = 2).
%C A199905 Column 4 of A199909.
%H A199905 R. H. Hardin, <a href="/A199905/b199905.txt">Table of n, a(n) for n = 1..200</a>
%e A199905 Some solutions for n=6
%e A199905 ..0....3....1....4...-4....4....1....1....2...-2....3....4...-4...-3....2...-2
%e A199905 ..2....1...-1...-3....1...-1....0....2...-2....3...-1...-1....4....2...-2....0
%e A199905 .-2...-4....3...-2...-3....3....2...-2....0...-4...-2...-2...-1....1....0....2
%e A199905 .-4....1....4...-1....1....1...-2....0....2...-3....2...-4....1....0....1....0
%e A199905 ..1...-1...-3....3....2...-4...-4...-1....1....2...-3....4...-1....1...-1....4
%e A199905 ..3....0...-4...-1....3...-3....3....0...-3....4....1...-1....1...-1....0...-4
%Y A199905 Cf. A199909.
%K A199905 nonn
%O A199905 1,2
%A A199905 _R. H. Hardin_ Nov 11 2011