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.

A202889 T(n,k)=Number of nXk 0..2 arrays with every nonzero element less than or equal to some horizontal or vertical neighbor.

Original entry on oeis.org

1, 3, 3, 9, 35, 9, 22, 265, 265, 22, 51, 1849, 5493, 1849, 51, 121, 13345, 109119, 109119, 13345, 121, 292, 96941, 2223723, 6092872, 2223723, 96941, 292, 704, 701275, 45332961, 348151747, 348151747, 45332961, 701275, 704, 1691, 5071167, 922352267
Offset: 1

Views

Author

R. H. Hardin, Dec 25 2011

Keywords

Examples

			Table starts
...1.......3...........9.............22.................51
...3......35.........265...........1849..............13345
...9.....265........5493.........109119............2223723
..22....1849......109119........6092872..........348151747
..51...13345.....2223723......348151747........56006562037
.121...96941....45332961....19914296913......9024909392725
.292..701275...922352267..1137589582096...1452080571954205
.704.5071167.18770352883.64992189188797.233641209300452607
Some solutions for n=3 k=3
..1..2..2....1..1..2....2..1..1....2..2..1....2..2..0....1..2..2....2..1..0
..0..0..2....2..2..2....2..0..1....1..2..1....0..0..0....2..2..0....2..1..1
..0..1..2....2..0..0....1..0..1....0..1..1....2..2..1....0..1..1....0..2..2