A203631 - 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

A203631

Number of nX1 0..1 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other

2, 4, 4, 2, 8, 12, 6, 32, 56, 32, 160, 270, 150, 840, 1512, 882, 4704, 8232, 4704, 26880, 48960, 28800, 158400, 282150, 163350, 943800, 1730300, 1022450, 5725720, 10306296, 6012006, 34978944, 64393056, 38158848, 216233472, 391923168

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

Column 1 of A203638

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..625

EXAMPLE

All solutions for n=5

..0....1....0....0....1....1....1....0

..0....1....0....0....1....0....1....1

..1....0....1....0....1....0....0....1