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.

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

Original entry on oeis.org

35, 1920, 118128, 7798591, 535504390, 37791169786, 2719090433234, 198527626261156, 14661270464301970, 1092691428398410348, 82050496246290924387, 6199895182931575557720, 470968211438917677149130
Offset: 1

Views

Author

R. H. Hardin Jan 04 2011

Keywords

Comments

Column 4 of A183419

Examples

			Some solutions for 6X4
..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..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..2....0..0..2..1....0..0..1..2....0..0..2..2....0..1..0..1
..1..0..0..0....2..2..2..0....2..1..2..2....1..0..2..1....0..1..1..0
..1..0..0..0....1..2..1..1....2..2..1..1....2..2..2..0....1..2..0..2