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.

A267630 Number of 4Xn arrays containing n copies of 0..4-1 with every element equal to or 1 greater than any west neighbor modulo 4 and the upper left element equal to 0.

Original entry on oeis.org

6, 27, 208, 2386, 32208, 445970, 6039160, 80742586, 1086798652, 14898269746, 208430268352, 2964609577834, 42639468240764, 617605254789776, 8990677585470960, 131473208822453124, 1931423573382740480
Offset: 1

Views

Author

R. H. Hardin, Jan 18 2016

Keywords

Comments

Row 4 of A267629.

Examples

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

Crossrefs

Cf. A267629.