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.

A199906 Number of -5..5 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, 60, 256, 1836, 12872, 77874, 547604, 3784512, 25525476, 179010266, 1249682864, 8709865930, 61360521500, 432263649142, 3049721406636, 21595190691722, 153069769124720, 1086568858888600, 7726348605601340
Offset: 1

Views

Author

R. H. Hardin Nov 11 2011

Keywords

Comments

Column 5 of A199909

Examples

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