[go: up one dir, main page]

login
A184228
Half the number of (n+1)X7 0..3 arrays with every 2X2 subblock diagonal sum differing from its antidiagonal sum by more than 3
1
6966, 541936, 22904858, 1292899174, 64280495958, 3390680573862, 174220807520698, 9060575120369248, 468666562795511632, 24302116797857458570, 1258755953102506894388, 65231670365062829035438
OFFSET
1,1
COMMENTS
Column 6 of A184231
LINKS
EXAMPLE
Some solutions for 3X7
..0..2..0..1..0..3..0....2..0..1..0..2..0..3....0..2..0..2..0..3..0
..3..0..3..0..3..0..3....0..3..0..3..1..3..0....3..1..3..1..3..0..1
..1..3..1..3..0..3..2....2..0..2..0..3..0..2....0..3..1..3..0..3..0
CROSSREFS
Sequence in context: A028542 A263287 A234111 * A050225 A305718 A237237
KEYWORD
nonn
AUTHOR
R. H. Hardin Jan 10 2011
STATUS
approved