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.

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

Original entry on oeis.org

6, 74, 2320, 77830, 2595190, 94930586, 3708826784, 148879349035, 6098536482216, 255081230000786, 10848711502940592, 467125765450160196, 20321101379722519804, 892020118445773622883, 39459836156094190716464
Offset: 1

Views

Author

R. H. Hardin, Jan 01 2016

Keywords

Comments

Row 4 of A266572.

Examples

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

Crossrefs

Cf. A266572.