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.

A252835 Number of nX7 nonnegative integer arrays with upper left 0 and every value within 2 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

22, 125, 850, 6211, 42738, 244131, 1056756, 3320837, 7822881, 14827629, 24422839, 36628371, 51446975, 68878827, 88923927, 111582275, 136853871, 164738715, 195236807, 228348147, 264072735, 302410571, 343361655, 386925987, 433103567
Offset: 1

Views

Author

R. H. Hardin, Dec 22 2014

Keywords

Comments

Column 7 of A252836

Examples

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

Formula

Empirical: a(n) = 1306624*n^2 - 17846996*n + 62638467 for n>11