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.

A252931 Number of n X n nonnegative integer arrays with upper left 0 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

1, 5, 44, 711, 17962, 578342, 21312696, 857248091, 36723156004, 1650365159314, 77015673357558, 3704833216794534, 182732875391479366, 9203662331845611018, 471886132793225715184, 24568007717042452684419, 1296265434331412271116602
Offset: 1

Views

Author

R. H. Hardin, Dec 24 2014

Keywords

Comments

Diagonal of A252938

Examples

			Some solutions for n=4
..0..0..1..1....0..0..1..1....0..0..1..1....0..0..1..1....0..0..1..1
..1..1..1..1....0..1..1..2....0..0..1..2....1..1..1..2....1..1..1..2
..1..1..1..1....0..1..2..2....0..1..1..2....2..2..2..2....2..2..2..2
..2..2..2..2....1..1..2..3....0..1..2..2....2..2..2..2....2..2..2..3