cp's OEIS Frontend

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.

A205816 Number of (n+1) X (n+1) 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock unequal to the number of counterclockwise edge increases.

This page as a plain text file.
%I A205816 #7 Dec 10 2015 02:10:09
%S A205816 24,216,2880,67944,2791080,206195280,27196042704,6437088838008,
%T A205816 2723887997403024,2064821553536444652,2798458452635665138464
%N A205816 Number of (n+1) X (n+1) 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 A205816 Diagonal of A205823.
%e A205816 Some solutions for n=4:
%e A205816 ..2..2..1..0..0....1..2..0..2..2....0..1..0..2..2....2..0..2..2..1
%e A205816 ..1..0..1..2..1....0..2..1..1..0....2..2..0..1..0....2..1..1..0..0
%e A205816 ..1..2..1..0..0....1..2..0..2..2....0..1..0..2..2....2..0..2..2..1
%e A205816 ..1..0..1..2..1....0..2..1..1..0....2..2..0..1..0....1..1..1..0..0
%e A205816 ..1..2..1..0..0....1..2..0..2..2....0..1..0..2..0....2..0..2..2..1
%K A205816 nonn
%O A205816 1,1
%A A205816 _R. H. Hardin_, Feb 01 2012

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.