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.

A186125 Number of (n+1)X7 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 A186125 #7 Jul 22 2025 10:15:38
%S A186125 182,1878,10502,79782,539962,4056794,29491822,220010616,1637583596,
%T A186125 12272724126,92041463782,692502277290,5211824476838,39292304082970,
%U A186125 296277012735686,2235990214584584,16877344601227160,127445629177320202
%N A186125 Number of (n+1)X7 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 A186125 Column 6 of A186128
%H A186125 R. H. Hardin, <a href="/A186125/b186125.txt">Table of n, a(n) for n = 1..200</a>
%e A186125 Some solutions for 3X7
%e A186125 ..1..0..1..0..1..1..1....0..1..0..0..1..0..0....1..0..0..1..1..0..0
%e A186125 ..1..1..1..1..1..0..0....1..1..1..0..0..0..0....1..0..0..0..0..0..1
%e A186125 ..0..1..0..1..1..0..0....1..0..1..0..0..1..1....0..0..1..0..0..0..1
%K A186125 nonn
%O A186125 1,1
%A A186125 _R. H. Hardin_ Feb 13 2011