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.

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

Original entry on oeis.org

16, 164, 2928, 44366, 969528, 16895850, 397550036, 7576693894, 184631622106, 3777035543236, 93707916130348, 2028328695512904, 50826307266520194
Offset: 1

Views

Author

R. H. Hardin Jan 09 2012

Keywords

Comments

Diagonal of A204039

Examples

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