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.

A203542 T(n,k)=Number of nXk 0..2 arrays with every element neighboring horizontally or vertically both a 0 and a 1.

Original entry on oeis.org

0, 0, 0, 0, 4, 0, 0, 4, 4, 0, 0, 16, 72, 16, 0, 0, 64, 144, 144, 64, 0, 0, 196, 1840, 3364, 1840, 196, 0, 0, 676, 10404, 30976, 30976, 10404, 676, 0, 0, 2304, 69920, 614656, 1700580, 614656, 69920, 2304, 0, 0, 7744, 490000, 8479744, 46485124, 46485124, 8479744
Offset: 1

Views

Author

R. H. Hardin Jan 02 2012

Keywords

Comments

Table starts
.0....0......0.........0...........0..............0................0
.0....4......4........16..........64............196..............676
.0....4.....72.......144........1840..........10404............69920
.0...16....144......3364.......30976.........614656..........8479744
.0...64...1840.....30976.....1700580.......46485124.......1680210240
.0..196..10404....614656....46485124.....3743237124.....257720706244
.0..676..69920...8479744..1680210240...257720706244...44312000955508
.0.2304.490000.129504400.56191754304.20056281523776.7260263864381124

Examples

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