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.

A183554 T(n,k)=Number of nXk 0..2 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.

Original entry on oeis.org

0, 3, 3, 3, 15, 3, 9, 71, 71, 9, 15, 299, 583, 299, 15, 33, 1325, 5287, 5287, 1325, 33, 63, 5845, 46841, 95101, 46841, 5845, 63, 129, 25785, 417809, 1728533, 1728533, 417809, 25785, 129, 255, 113841, 3721925, 31363527, 63868351, 31363527, 3721925, 113841
Offset: 1

Views

Author

R. H. Hardin Jan 05 2011

Keywords

Comments

Table starts
...0.......3..........3.............9...............15..................33
...3......15.........71...........299.............1325................5845
...3......71........583..........5287............46841..............417809
...9.....299.......5287.........95101..........1728533............31363527
..15....1325......46841.......1728533.........63868351..........2359134621
..33....5845.....417809......31363527.......2359134621........177385265619
..63...25785....3721925.....569461759......87176303417......13344696858771
.129..113841...33169105...10339213765....3221377019429....1003889179688773
.255..502523..295565367..187720469393..119037100116183...75519989933088273
.513.2218399.2633809823.3408294462361.4398697422258081.5681183354145927001

Examples

			Some solutions for 4X3
..0..0..1....0..0..1....0..0..0....0..0..1....1..0..0....1..1..0....1..1..1
..2..0..1....0..2..1....2..2..0....2..2..1....1..1..0....0..0..0....1..2..1
..2..0..0....2..2..2....2..1..2....2..1..1....0..1..0....0..0..1....1..2..1
..2..2..2....0..0..0....2..1..2....2..2..1....0..1..1....2..2..1....1..2..1
		

Crossrefs

Column 1 is A062510(n-1)