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.

A237332 T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the upper median plus the lower median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.

Original entry on oeis.org

81, 320, 320, 1264, 1660, 1264, 5120, 8588, 8588, 5120, 20692, 45996, 58296, 45996, 20692, 82800, 242644, 414268, 414268, 242644, 82800, 332192, 1279474, 2870224, 3988852, 2870224, 1279474, 332192, 1346016, 6740992, 19874388, 36921568
Offset: 1

Views

Author

R. H. Hardin, Feb 06 2014

Keywords

Comments

Table starts
.......81........320........1264..........5120...........20692...........82800
......320.......1660........8588.........45996..........242644.........1279474
.....1264.......8588.......58296........414268.........2870224........19874388
.....5120......45996......414268.......3988852........36921568.......342809906
....20692.....242644.....2870224......36921568.......449909120......5467718444
....82800....1279474....19874388.....342809906......5467718444.....88161950500
...332192....6740992...137663582....3194951224.....67160833084...1426506722524
..1346016...36117846...978134492...31126440590....873971263352..24924114752042
..5439936..190631336..6780688008..290583883424..10725570823166.399514227564720
.21769152.1005363146.46959680920.2718308070358.130884937973764

Examples

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

Formula

Empirical for column k:
k=1: a(n) = 288*a(n-4) -6720*a(n-8) +33536*a(n-12) for n>15
k=2: [order 32] for n>34