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.

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

Original entry on oeis.org

81, 434, 434, 2336, 3240, 2336, 12624, 24340, 24340, 12624, 68064, 183764, 255937, 183764, 68064, 366568, 1379886, 2712486, 2712486, 1379886, 366568, 1976940, 10406596, 28732972, 41204198, 28732972, 10406596, 1976940, 10657560, 78612538
Offset: 1

Views

Author

R. H. Hardin, Feb 07 2014

Keywords

Comments

Table starts
........81.........434..........2336..........12624...........68064
.......434........3240.........24340.........183764.........1379886
......2336.......24340........255937........2712486........28732972
.....12624......183764.......2712486.......41204198.......629612266
.....68064.....1379886......28732972......629612266.....14010191373
....366568....10406596.....306543648.....9678405410....312459028946
...1976940....78612538....3277420369...148794944054...6958669132771
..10657560...593121116...34947393232..2283761004002.154932883163426
..57441532..4469323758..371861162189.34983096932494
.309578264.33698637958.3961014934240

Examples

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

Formula

Empirical for column k:
k=1: [linear recurrence of order 20]
k=2: [order 58] for n>59