A146320 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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”).

Other ways to Give

A146320

Number of n X n arrays of squares of integers with every (n-1)X(n-1) subblock summing to 9 and every element equal to at least one neighbor.

%I #4 Dec 18 2015 18:17:14

%S 0,1,10742,1562979,19868428,116875556,471829672,1513833810,4145705032,

%T 10094479834,22430185920

%N Number of n X n arrays of squares of integers with every (n-1)X(n-1) subblock summing to 9 and every element equal to at least one neighbor.

%K nonn

%O 3,3

%A _R. H. Hardin_ Apr 14 2009