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.

A236809 T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the lower median minus the upper median minus the minimum of every 2X2 subblock equal.

Original entry on oeis.org

81, 277, 277, 1033, 1435, 1033, 4183, 8825, 8825, 4183, 17481, 60187, 85929, 60187, 17481, 75907, 410305, 929447, 929447, 410305, 75907, 330433, 2926867, 9558409, 16530709, 9558409, 2926867, 330433, 1468723, 20377961, 107087939, 270610375
Offset: 1

Views

Author

R. H. Hardin, Jan 31 2014

Keywords

Comments

Table starts
.......81........277..........1033............4183..............17481
......277.......1435..........8825...........60187.............410305
.....1033.......8825.........85929..........929447............9558409
.....4183......60187........929447........16530709..........270610375
....17481.....410305.......9558409.......270610375.........6612746409
....75907....2926867.....107087939......5140896385.......203606804707
...330433...20377961....1117775361.....86863046591......5094225962785
..1468723..147734251...12821027315...1730194335025....167431587932179
..6479721.1039350577..135199336873..29809824906343...4238424064205001
.29026267.7613312515.1580326999835.613527734331097.146743496294875195

Examples

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

Formula

Empirical for column k:
k=1: a(n) = 5*a(n-1) +20*a(n-2) -130*a(n-3) +36*a(n-4) +600*a(n-5) -720*a(n-6)
k=2: [order 10]
k=3: [order 11]
k=4: [order 13]
k=5: [order 13]
k=6: [order 17]
k=7: [order 16]