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.

A266457 Number of 4Xn arrays containing n copies of 0..4-1 with no element 1 greater than its north neighbor modulo 4 and the upper left element equal to 0.

Original entry on oeis.org

2, 101, 6152, 442285, 34667512, 2875874396, 248188720768, 22053860939581, 2004232543930760, 185418855352374916, 17404087748977051168, 1653341486254703216284, 158659220471195369806688
Offset: 1

Views

Author

R. H. Hardin, Dec 29 2015

Keywords

Comments

Row 4 of A266455.

Examples

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

Crossrefs

Cf. A266455.