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.

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

Original entry on oeis.org

1, 4, 4, 16, 84, 16, 50, 1080, 1080, 50, 144, 12260, 48552, 12260, 144, 422, 143510, 2029744, 2029744, 143510, 422, 1268, 1705124, 87531478, 308642476, 87531478, 1705124, 1268, 3823, 20174774, 3790420430, 48260497186, 48260497186
Offset: 1

Views

Author

R. H. Hardin Dec 29 2011

Keywords

Comments

Table starts
....1.........4............16.................50....................144
....4........84..........1080..............12260.................143510
...16......1080.........48552............2029744...............87531478
...50.....12260.......2029744..........308642476............48260497186
..144....143510......87531478........48260497186.........27467664499412
..422...1705124....3790420430......7574530822364......15712898935252156
.1268..20174774..163621176194...1186165852092876....8968410661761080882
.3823.238288768.7062389921398.185750876557274124.5118067454812170831280

Examples

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

Crossrefs

For some rows, columns and diagonals see A203093-A203100.