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.

A239400 Number of nX3 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

8, 105, 1337, 16449, 205969, 2590704, 32507376, 408000104, 5124790809, 64375497505, 808627026775, 10157673828398, 127600254367522, 1602912146570029, 20135780318743491, 252946235316308314
Offset: 1

Views

Author

R. H. Hardin, Mar 17 2014

Keywords

Comments

Column 3 of A239405

Examples

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

Formula

Empirical recurrence of order 64 (see link above)