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.

A252981 Number of nX6 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

10, 85, 851, 8487, 67537, 432842, 5672484, 36112108, 129234988, 322183180, 635379492, 1074743076, 1640984356, 2334103332, 3154100004, 4100974372, 5174726436, 6375356196, 7702863652, 9157248804, 10738511652, 12446652196
Offset: 1

Views

Author

R. H. Hardin, Dec 25 2014

Keywords

Comments

Column 6 of A252983

Examples

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

Formula

Empirical: a(n) = 63438848*n^2 - 1019729920*n + 4176308004 for n>10