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.

A202247 Number of zero-sum -3..3 arrays of n elements with adjacent element differences also in -3..3.

Original entry on oeis.org

1, 3, 17, 81, 397, 2003, 10239, 52697, 273021, 1422337, 7442827, 39091861, 205972443, 1088212379, 5762943375, 30582601227, 162591973175, 865826349887, 4617379607829, 24656446918287, 131820057982369, 705507882790695
Offset: 1

Views

Author

R. H. Hardin Dec 14 2011

Keywords

Comments

Column 3 of A202252

Examples

			Some solutions for n=8
.-1...-3....2...-2...-3....0....3....0...-1...-2...-1....3...-2...-1....2....3
.-3...-3....3....1...-3....0....2....2....2....0....1....3....0....1...-1....0
..0....0....1...-2....0...-2....2....0....0....0...-2....0....0...-1...-3....3
..2....3....1....1....2....0....0...-1....1....1....0....0...-3...-1....0....1
..1....0...-2....0...-1....0...-3...-1...-1....2....0...-2....0....0....1...-2
..0....1...-2....1....0....1...-2....1....2....0....0....0....2....0....1....0
..0....1...-1....2....3....1...-2...-2...-1....1....0...-2....2....1...-1...-3
..1....1...-2...-1....2....0....0....1...-2...-2....2...-2....1....1....1...-2