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.

A185776 Number of (n+1)X7 0..2 arrays with no 2X2 subblock sum equal to any horizontal or vertical neighbor 2X2 subblock sum.

This page as a plain text file.
%I A185776 #6 Jul 22 2025 10:00:16
%S A185776 1296000,190416934,27239862108,4212755548948,641850855452998
%N A185776 Number of (n+1)X7 0..2 arrays with no 2X2 subblock sum equal to any horizontal or vertical neighbor 2X2 subblock sum.
%C A185776 Column 6 of A185777
%e A185776 Some solutions for 3X7
%e A185776 ..0..0..1..2..0..2..2....0..0..1..1..2..1..0....0..0..1..0..2..1..2
%e A185776 ..0..1..0..0..0..2..2....0..2..0..2..2..0..0....0..0..0..2..1..2..0
%e A185776 ..0..1..1..1..0..0..2....0..1..1..2..2..0..2....0..1..1..1..2..2..2
%K A185776 nonn
%O A185776 1,1
%A A185776 _R. H. Hardin_ Feb 03 2011

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

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