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

A206667

Number of (n+1) X 8 0..2 arrays with every 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward and upward neighbors.

2046027, 38594841, 1770039198, 108688211619, 7050554283159, 464729380449429, 30831727837091925, 2051665393581595494, 136747710613864831857, 9121868183571809071275, 608769411415765774933107

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

OFFSET

1,1

COMMENTS

Column 7 of A206668.

LINKS

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

EXAMPLE

Some solutions for n=4:

..1..1..2..2..1..2..2..1....1..1..0..0..1..2..0..1....0..1..2..1..1..1..1..1

..1..2..2..1..1..2..1..1....0..1..0..1..1..2..0..1....2..2..2..2..2..2..2..0

..1..2..1..1..2..2..1..2....0..1..0..1..2..2..0..0....2..0..0..0..0..0..1..2

..2..2..2..1..1..1..1..1....0..0..0..1..1..2..0..1....2..0..1..1..1..2..0..0

..2..1..1..1..2..2..1..0....2..2..0..0..1..2..0..0....2..0..1..2..0..1..0..1

CROSSREFS

Sequence in context: A272598 A190316 A034639 * A251512 A113568 A186915

Adjacent sequences: A206664 A206665 A206666 * A206668 A206669 A206670

KEYWORD

nonn

AUTHOR

R. H. Hardin, Feb 11 2012

STATUS

approved