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!)
 A206276 Number of (n+1) X 8 0..2 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors. 1
 309057, 408198, 1528920, 6254364, 33297948, 167821686, 964315869, 4586324364, 22656222912, 107944182948, 562553467470, 2820402520110, 14881797312963, 75177032639256, 401169616195323, 2040321270376866, 10870614344272152 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Column 7 of A206277. LINKS R. H. Hardin, Table of n, a(n) for n = 1..210 EXAMPLE Some solutions for n=4: ..0..0..2..2..0..0..2..1....0..2..2..2..1..2..2..1....1..2..2..1..2..0..0..1 ..1..1..0..0..2..2..0..0....0..2..2..0..2..2..2..1....0..2..2..2..0..0..0..1 ..1..1..0..0..2..2..0..0....2..0..0..2..2..2..0..2....2..0..2..2..0..0..1..2 ..0..0..1..1..0..0..1..1....0..0..0..2..2..1..2..2....2..2..0..0..1..1..2..2 ..0..0..1..1..0..0..1..1....0..0..1..0..0..2..2..2....2..2..0..0..1..1..1..0 CROSSREFS Sequence in context: A236818 A234188 A226364 * A251304 A127491 A205204 Adjacent sequences: A206273 A206274 A206275 * A206277 A206278 A206279 KEYWORD nonn AUTHOR R. H. Hardin, Feb 05 2012 STATUS approved

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 29 08:47 EST 2022. Contains 358422 sequences. (Running on oeis4.)