login

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

A234457
Number of (n+1) X (6+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1 (constant-stress 1 X 1 tilings).
0
16026240, 1246417268, 108833647220, 10112283614188, 968883628673536, 94562060782336540, 9313238635318242880, 923173430231908792924, 91746122270765342416988
OFFSET
1,1
EXAMPLE
Some solutions for n=1:
0 3 1 2 2 2 1 0 0 0 0 2 1 1 0 0 3 5 3 1 5
0 4 3 3 2 1 1 0 1 0 1 4 2 3 0 1 3 4 3 0 3
CROSSREFS
Column 6 of A234458.
Sequence in context: A058909 A179585 A105650 * A204604 A253716 A216004
KEYWORD
nonn
AUTHOR
R. H. Hardin, Dec 26 2013
STATUS
approved