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.

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

Original entry on oeis.org

1, 8, 84, 448, 3196, 29864, 216530, 1699268, 14546928, 116482068, 950119628, 7969545520, 65812921362, 546169532636, 4575686136942, 38231452993064, 320077674218718, 2689588505089064, 22606933344228744, 190257872374203952
Offset: 1

Views

Author

R. H. Hardin Nov 11 2011

Keywords

Comments

Column 6 of A199909

Examples

			Some solutions for n=6
.-6...-3...-2....0...-5....2....6...-4...-3....0....4....2...-3....2...-5....4
..2...-1....2...-1....5....4...-2....4...-2....1...-4....1...-4...-5...-4...-4
..1....6....0...-5....0...-1...-4...-6....5...-3....0...-3....4...-6....6....3
..5....1....1....5...-5...-6...-2...-2....1...-2....2....5....0....1....4...-2
.-2...-1...-4...-3....5...-5....3....5...-1....6....1...-5...-2....5...-4....2
..0...-2....3....4....0....6...-1....3....0...-2...-3....0....5....3....3...-3