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.

A253005 Number of n X n nonnegative integer arrays with upper left 0 and lower right its king-move distance away minus 3 and every value increasing by 0 or 1 with every step right, diagonally se or down.

Original entry on oeis.org

0, 0, 0, 1, 250, 54219, 14697256, 5713126349, 3406380649146, 3235013673306411, 5006915703789559516, 12814921349279258614386, 54759970343589573849950696, 393147238947490609962950665584, 4762079888047633609309896734274288
Offset: 1

Views

Author

R. H. Hardin, Dec 25 2014

Keywords

Comments

Diagonal of A253011.

Examples

			Some solutions for n=6:
..0..0..0..0..0..0....0..0..0..0..0..0....0..1..1..1..1..2....0..0..1..1..1..2
..0..0..0..0..0..1....0..0..0..1..1..1....1..1..1..1..1..2....0..0..1..1..1..2
..0..0..1..1..1..1....0..0..0..1..1..1....1..1..1..1..1..2....0..1..1..1..2..2
..0..0..1..1..1..2....0..0..0..1..1..2....1..1..1..1..1..2....1..1..1..2..2..2
..0..0..1..1..1..2....0..0..0..1..1..2....1..1..1..1..1..2....1..1..1..2..2..2
..1..1..1..1..1..2....1..1..1..1..2..2....1..2..2..2..2..2....1..1..1..2..2..2