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.

A183418 Number of n X 5 0..2 arrays with each sum of a(1..i,1..j) no greater than i*j.

Original entry on oeis.org

96, 15232, 2748326, 535504390, 108917015732, 22819790947743, 4882354760830113, 1061262556019472565, 233540084105702534983, 51902083367733896338751, 11628306862159911222856791, 2622857292112189173922446856
Offset: 1

Views

Author

R. H. Hardin, Jan 04 2011

Keywords

Comments

Column 5 of A183419.

Examples

			Some solutions for 4 X 5
..0..0..0..0..0....0..0..0..0..0....0..0..0..0..0....0..0..0..0..0
..0..0..0..0..0....0..0..0..0..0....0..0..0..0..1....0..0..0..0..0
..1..1..2..2..1....2..2..0..0..2....1..1..2..0..2....0..1..0..2..2
..1..2..2..2..1....0..2..1..1..0....0..2..1..0..1....2..2..0..1..0
		

Crossrefs

Cf. A183419.