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.

A239402 Number of nX5 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of elements above it, modulo 4.

Original entry on oeis.org

32, 2165, 144762, 9340070, 614216271, 40566958960, 2671846338458, 176044655676921, 11610439554314901, 765805659265654829, 50509810922229600429, 3331665731491459450247, 219768507035072764751942
Offset: 1

Views

Author

R. H. Hardin, Mar 17 2014

Keywords

Comments

Column 5 of A239405

Examples

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