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.

A240197 Number of 7Xn 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or three plus the sum of the elements diagonally to its northwest, modulo 4.

Original entry on oeis.org

15, 358, 10017, 333607, 14022582, 733907809, 43398047802, 2752449791995, 182092505409165, 12353055792220215, 850428778272052568, 59048111282882480477, 4120092662704003963630
Offset: 1

Views

Author

R. H. Hardin, Apr 02 2014

Keywords

Comments

Row 7 of A240192

Examples

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