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.

A183419 T(n,k)=Number of nXk 0..2 arrays with each sum of a(1..i,1..j) no greater than i*j.

Original entry on oeis.org

2, 5, 5, 13, 34, 13, 35, 249, 249, 35, 96, 1920, 5257, 1920, 96, 267, 15232, 118128, 118128, 15232, 267, 750, 123323, 2748326, 7798591, 2748326, 123323, 750, 2123, 1012996, 65521060, 535504390, 535504390, 65521060, 1012996, 2123, 6046, 8413325
Offset: 1

Views

Author

R. H. Hardin Jan 04 2011

Keywords

Comments

Table starts
.....2.........5.............13..................35....................96
.....5........34............249................1920.................15232
....13.......249...........5257..............118128...............2748326
....35......1920.........118128.............7798591.............535504390
....96.....15232........2748326...........535504390..........108917015732
...267....123323.......65521060.........37791169786........22819790947743
...750...1012996.....1589310971.......2719090433234......4882354760830113
..2123...8413325....39061152272.....198527626261156...1061262556019472565
..6046..70482133...969912553822...14661270464301970.233540084105702534983
.17303.594587235.24282796177101.1092691428398410348

Examples

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

Crossrefs

Column 1 is A005773(n+1)