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.

A240050 Number of 5 X n 0..3 arrays with no element equal to zero plus the sum of elements to its left or zero plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4.

Original entry on oeis.org

8, 50, 309, 1496, 7514, 55034, 236282, 1248277, 6431987, 29170979, 155931126, 801190472, 4068998418, 19619747500, 103973075128, 508889855031, 2476317886402, 12705627199443, 63280997191424, 313215400063102
Offset: 1

Views

Author

R. H. Hardin, Mar 31 2014

Keywords

Comments

Row 5 of A240046.

Examples

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

Crossrefs

Cf. A240046.