This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A205822 #7 Dec 10 2015 02:13:38 %S A205822 10032,96402,1002240,12281976,156410676,2053746000,27196042704, %T A205822 362290015758,4834444163676,64590005130132,863239060201212, %U A205822 11540056054532778,154281470426981232,2062735520293913052 %N A205822 Number of (n+1) X 8 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock unequal to the number of counterclockwise edge increases. %C A205822 Column 7 of A205823. %H A205822 R. H. Hardin, <a href="/A205822/b205822.txt">Table of n, a(n) for n = 1..210</a> %e A205822 Some solutions for n=4: %e A205822 ..2..1..2..0..2..0..0..0....0..0..0..0..2..1..2..1....0..2..1..1..0..0..2..2 %e A205822 ..2..0..2..1..1..1..2..1....2..1..2..1..2..0..2..0....1..2..0..2..2..1..1..0 %e A205822 ..1..1..2..0..2..0..2..0....2..0..0..0..2..1..1..1....0..2..1..1..0..0..2..0 %e A205822 ..2..0..2..1..1..0..1..1....2..1..2..1..2..0..2..0....1..2..0..2..2..1..1..0 %e A205822 ..1..1..2..0..2..0..2..0....0..0..2..0..2..1..1..0....0..2..1..1..0..0..2..0 %K A205822 nonn %O A205822 1,1 %A A205822 _R. H. Hardin_, Feb 01 2012