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.

A252998 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 within 3 of its king move distance from the upper left 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, 69, 3072, 122833, 4915726, 204051186, 8849413857, 399736867216, 18698541563923, 900653139548828, 44458651801451163, 2240500172425946056, 114922424191743943701, 5985232324581998309113, 315879022416448194306768
Offset: 1

Views

Author

R. H. Hardin, Dec 25 2014

Keywords

Comments

Diagonal of A253004.

Examples

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

Crossrefs

Cf. A253004.