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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A235090 Number of (n+1) X (n+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). 0

%I

%S 80,656,3832,21264,102336,524728,2420288,12147808,55604120,276524288,

%T 1267295968,6262860184

%N Number of (n+1) X (n+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).

%e Some solutions for n=4:

%e 2 1 2 3 5 0 2 3 4 2 1 3 1 2 0 3 2 1 4 3

%e 0 3 0 5 3 2 0 5 2 4 3 1 3 0 2 5 0 3 2 5

%e 2 1 2 3 5 0 2 3 4 2 2 4 2 3 1 2 1 0 3 2

%e 0 3 0 5 3 2 0 5 2 4 5 3 5 2 4 5 0 3 2 5

%e 1 0 1 2 4 1 3 4 5 3 2 4 2 3 1 3 2 1 4 3

%Y Diagonal of A235098.

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 03 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 27 10:03 EST 2022. Contains 358367 sequences. (Running on oeis4.)