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.

A238255 T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with 2X2 subblock sums lexicographically nondecreasing columnwise and rowwise.

Original entry on oeis.org

16, 44, 44, 121, 180, 121, 286, 804, 804, 286, 676, 2818, 6828, 2818, 676, 1482, 9991, 43456, 43456, 9991, 1482, 3249, 29995, 284992, 523578, 284992, 29995, 3249, 6840, 90225, 1473792, 6683137, 6683137, 1473792, 90225, 6840, 14400, 241945, 7616082
Offset: 1

Views

Author

R. H. Hardin, Feb 21 2014

Keywords

Comments

Table starts
....16......44.......121..........286.............676.............1482
....44.....180.......804.........2818............9991............29995
...121.....804......6828........43456..........284992..........1473792
...286....2818.....43456.......523578.........6683137.........65450601
...676....9991....284992......6683137.......171041320.......3320993180
..1482...29995...1473792.....65450601......3320993180.....128727296869
..3249...90225...7616082....640472606.....64353451945....5017308028639
..6840..241945..32986844...5080416791....992794904591..154350327958339
.14400..649320.142361644..40066932588..15160526139045.4704917436206270
.29640.1605951.537301496.267891545518.192941078342371

Examples

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

Crossrefs

Column 1 is A204032

Formula

Empirical for column k:
k=1: a(n) = 4*a(n-1) -18*a(n-3) +17*a(n-4) +22*a(n-5) -36*a(n-6) +20*a(n-8) -8*a(n-9)
k=2: [order 33]
k=3: [order 81]