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.

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

Original entry on oeis.org

0, 0, 1, 68, 4657, 432842, 60650883, 13458882036, 4857082197177, 2895119784219358, 2877300288177184239, 4796057029604523514392, 13457301734652492685623300, 63707500883584152928303777296
Offset: 1

Views

Author

R. H. Hardin, Dec 25 2014

Keywords

Comments

Diagonal of A252983

Examples

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