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.

A183584 T(n,k)=Half the number of nXk 0..3 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.

Original entry on oeis.org

0, 2, 2, 2, 14, 2, 8, 78, 78, 8, 14, 407, 814, 407, 14, 38, 2216, 9667, 9667, 2216, 38, 80, 12024, 110674, 240358, 110674, 12024, 80, 194, 65277, 1282814, 5987795, 5987795, 1282814, 65277, 194, 434, 354615, 14823037, 149355515, 320224986, 149355515
Offset: 1

Views

Author

R. H. Hardin Jan 05 2011

Keywords

Comments

Table starts
....0........2...........2..............8.................14
....2.......14..........78............407...............2216
....2.......78.........814...........9667.............110674
....8......407........9667.........240358............5987795
...14.....2216......110674........5987795..........320224986
...38....12024.....1282814......149355515........17195908538
...80....65277....14823037.....3724940988.......922710498351
..194...354615...171459557....92915045150.....49526167251643
..434..1926386..1982720806..2317648165893...2658141294593252
.1016.10465655.22929915669.57811518197886.142669482408162261

Examples

			Some solutions with a(1,1)<=1 for 4X3
..1..1..3....1..3..3....1..0..3....1..2..2....0..2..2....1..2..2....1..3..3
..1..3..3....1..1..1....1..0..3....1..1..3....0..0..0....1..1..3....1..0..0
..2..1..3....1..1..1....0..0..0....1..1..3....0..2..2....0..3..3....1..3..3
..2..1..1....2..2..2....0..1..1....1..1..1....2..2..2....0..0..3....3..3..3
		

Crossrefs

Column 1 is 2*A006130(n-2)