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.

A239825 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, modulo 4.

Original entry on oeis.org

293, 78188, 28156167, 9807771898, 3347474694032, 1154988223050638, 399696014140196630, 138146553326582677362, 47759100046784529992245, 16518942523671833416785350, 5714008803899171208707626059
Offset: 1

Views

Author

R. H. Hardin, Mar 27 2014

Keywords

Comments

Row 7 of A239819

Examples

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