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.

A185774 Number of (n+1)X5 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 A185774 #7 Jul 22 2025 10:00:02
%S A185774 26784,1151346,48744342,2171002788,95851024672,4212755548948,
%T A185774 184696487434352,8130440303768416,357605861336206826,
%U A185774 15723990359863559644,691174683753522142476,30395002285452611004698
%N A185774 Number of (n+1)X5 0..2 arrays with no 2X2 subblock sum equal to any horizontal or vertical neighbor 2X2 subblock sum.
%C A185774 Column 4 of A185777
%H A185774 R. H. Hardin, <a href="/A185774/b185774.txt">Table of n, a(n) for n = 1..39</a>
%e A185774 Some solutions for 3X5
%e A185774 ..0..1..0..1..0....0..0..0..0..1....0..1..2..2..2....0..2..2..1..1
%e A185774 ..0..1..2..2..0....0..2..2..0..2....0..0..2..1..1....0..0..1..0..1
%e A185774 ..1..2..1..2..0....0..1..1..2..0....1..1..1..2..1....1..0..2..2..1
%K A185774 nonn
%O A185774 1,1
%A A185774 _R. H. Hardin_ Feb 03 2011