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.

A186119 Number of (n+1)X(n+1) binary arrays with every 2X2 subblock diagonal sum less antidiagonal sum equal to some horizontal or vertical neighbor 2X2 subblock diagonal sum less antidiagonal sum.

This page as a plain text file.
%I A186119 #7 Jul 22 2025 10:15:09
%S A186119 0,38,262,4254,90054,4056794,264173146,33067061342,6424488086390
%N A186119 Number of (n+1)X(n+1) binary arrays with every 2X2 subblock diagonal sum less antidiagonal sum equal to some horizontal or vertical neighbor 2X2 subblock diagonal sum less antidiagonal sum.
%C A186119 Diagonal of A186128
%e A186119 Some solutions for 3X3
%e A186119 ..1..1..0....0..1..0....0..1..1....1..1..1....0..1..1....1..1..1....0..1..1
%e A186119 ..0..1..1....0..1..0....1..1..0....1..1..1....1..1..1....0..0..0....0..0..0
%e A186119 ..1..1..0....0..1..0....0..1..1....0..0..0....1..0..0....0..0..0....1..0..0
%K A186119 nonn
%O A186119 1,2
%A A186119 _R. H. Hardin_ Feb 13 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.