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.

A240417 Number of 6Xn 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 zero plus the sum of the elements diagonally to its northwest, modulo 4.

Original entry on oeis.org

129, 2105, 79090, 2051450, 45245148, 1615637679, 38249442962, 955439201951, 28422088797325, 653249891295733, 18365583086851745, 495763997190145130, 12117652634246661607, 341107664098435880768, 8779799870508201530267
Offset: 1

Views

Author

R. H. Hardin, Apr 04 2014

Keywords

Comments

Row 6 of A240412

Examples

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