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.

A183415 Number of nX2 0..2 arrays with each sum of a(1..i,1..j) no greater than i*j.

Original entry on oeis.org

5, 34, 249, 1920, 15232, 123323, 1012996, 8413325, 70482133, 594587235, 5044756083, 43007895169, 368151018388, 3162466934006, 27248906449457, 235414313839524, 2038652180610193, 17691623325368274, 153819626587560407
Offset: 1

Views

Author

R. H. Hardin Jan 04 2011

Keywords

Comments

Column 2 of A183419

Examples

			Some solutions for 4X2
..0..0....1..0....1..0....0..0....1..0....0..0....1..0....0..2....0..1....0..0
..2..2....1..0....0..2....1..2....0..1....0..0....0..2....2..0....0..0....2..2
..1..0....1..2....0..2....0..1....1..0....0..2....1..2....0..1....2..0....0..1
..1..0....0..2....2..0....2..2....1..2....2..0....0..2....0..0....0..0....0..1