Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Dec 25 2014 08:32:37
%S 15,145,1836,27905,433401,5672484,60650883,766674140,4970634131,
%T 18692194423,49050683133,101029007619,176694157069,276519316503,
%U 400550856993,548788778539,721233081141,917883764799,1138740829513
%N Number of nX7 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
%C Column 7 of A252983
%H R. H. Hardin, <a href="/A252982/b252982.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 12103190528*n^2 - 226960984822*n + 1081747760523 for n>12
%e Some solutions for n=4
%e ..0..0..1..1..1..1..1....0..1..1..2..2..3..3....0..1..1..2..2..2..2
%e ..0..0..1..2..2..2..2....1..1..2..2..3..3..3....0..1..1..2..2..2..2
%e ..1..1..1..2..3..3..3....1..1..2..3..3..3..4....0..1..1..2..3..3..3
%e ..1..2..2..2..3..4..4....1..1..2..3..3..3..4....0..1..1..2..3..3..4
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 25 2014