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.

A253008 Number of nX5 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

4, 19, 54, 124, 250, 14795, 309990, 2853292, 14125312, 46481352, 116171792, 240747928, 438003360, 725775144, 1121905200, 1644235704, 2310608832, 3138866760, 4146851664, 5352405720, 6773371104, 8427589992, 10332904560
Offset: 1

Views

Author

R. H. Hardin, Dec 25 2014

Keywords

Comments

Column 5 of A253011

Examples

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

Formula

Empirical: a(n) = 2973696*n^3 - 70716096*n^2 + 570494664*n - 1560617160 for n>12