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.

A185770 Number of (n+1)X(n+1) 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 A185770 #7 Jul 22 2025 09:59:41
%S A185770 81,7074,2046098,2171002788,7861640359954
%N A185770 Number of (n+1)X(n+1) 0..2 arrays with no 2X2 subblock sum equal to any horizontal or vertical neighbor 2X2 subblock sum.
%C A185770 Diagonal of A185777
%e A185770 Some solutions for 3X3
%e A185770 ..2..1..2....0..0..1....2..0..0....2..1..1....1..2..1....1..1..0....2..1..1
%e A185770 ..0..2..2....1..1..2....1..1..0....2..0..1....0..1..2....1..0..0....0..0..0
%e A185770 ..0..1..0....0..1..1....2..2..1....1..1..0....2..0..1....2..1..1....0..2..2
%K A185770 nonn
%O A185770 1,1
%A A185770 _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.