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.

A204227 Number of (n+1) X 6 0..2 arrays with the sums of 2 X 2 subblocks nondecreasing rightwards and downwards.

Original entry on oeis.org

49284, 2173565, 87487117, 2019310610, 45791699846, 687853333430, 10297878073062, 113754005579615, 1254605391285859, 10988697166912314, 96030748646457765, 701414832964037835, 5107498255064984418
Offset: 1

Views

Author

R. H. Hardin Jan 13 2012

Keywords

Comments

Column 5 of A204230.

Examples

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

Crossrefs

Cf. A204230.