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.

A183367 Number of nX5 binary arrays with no element equal to the sum mod 3 of its horizontal and vertical neighbors.

This page as a plain text file.
%I A183367 #7 Jul 22 2025 08:52:17
%S A183367 4,21,108,548,3102,17101,95674,543837,3094889,17654882,100922299,
%T A183367 576885277,3298560872,18868606128,107935859047,617459322870,
%U A183367 3532519181939,20210076149240,115625671366613,661524633792529
%N A183367 Number of nX5 binary arrays with no element equal to the sum mod 3 of its horizontal and vertical neighbors.
%C A183367 Column 5 of A183368
%H A183367 R. H. Hardin, <a href="/A183367/b183367.txt">Table of n, a(n) for n = 1..200</a>
%e A183367 Some solutions for 7X5
%e A183367 ..0..1..1..0..1....0..1..0..1..1....1..1..1..1..0....0..1..0..1..1
%e A183367 ..1..1..1..0..0....0..0..0..1..1....1..0..0..1..0....1..0..0..1..1
%e A183367 ..1..0..1..0..1....1..0..0..0..0....1..0..0..1..1....0..0..0..1..0
%e A183367 ..1..1..1..0..0....0..0..1..1..0....1..1..1..0..1....0..1..1..1..0
%e A183367 ..0..0..0..0..0....0..1..1..1..0....0..0..1..1..1....1..1..0..0..1
%e A183367 ..0..0..1..1..1....1..1..0..1..1....1..0..0..0..0....1..1..0..0..0
%e A183367 ..1..0..1..1..1....1..1..1..1..1....0..0..1..0..1....1..1..0..1..0
%K A183367 nonn
%O A183367 1,1
%A A183367 _R. H. Hardin_ Jan 04 2011