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.

A239821 Number of 3Xn 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

11, 113, 1480, 18728, 232272, 2912793, 36627126, 459870638, 5774508494, 72538478424, 911227478673, 11446501405086, 143789611879946, 1806288798172920, 22690641341877163, 285040443527806965
Offset: 1

Views

Author

R. H. Hardin, Mar 27 2014

Keywords

Comments

Row 3 of A239819

Examples

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

Formula

Empirical recurrence of order 64 (see link above)