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.

A183366 Number of n X 4 binary arrays with no element equal to the sum modulo 3 of its horizontal and vertical neighbors.

This page as a plain text file.
%I A183366 #12 Jun 22 2024 04:48:02
%S A183366 3,12,39,138,548,2129,8311,32933,130750,519980,2069494,8238734,
%T A183366 32801506,130618157,520176813,2071605150,8250287558,32857555574,
%U A183366 130858980239,521161959522,2075594388132,8266327630092,32921750282882,131115278622574,522184203094342,2079668830404846
%N A183366 Number of n X 4 binary arrays with no element equal to the sum modulo 3 of its horizontal and vertical neighbors.
%H A183366 R. H. Hardin, <a href="/A183366/b183366.txt">Table of n, a(n) for n = 1..200</a>
%e A183366 Some solutions for 5 X 4:
%e A183366   1 0 1 0    1 0 0 0    1 1 0 0    1 1 0 0    1 1 1 0
%e A183366   0 0 0 1    0 0 1 1    1 1 0 1    1 1 0 1    1 0 1 0
%e A183366   0 1 0 0    1 0 1 1    0 0 0 0    0 0 0 0    1 1 1 0
%e A183366   1 0 0 1    0 0 1 1    1 1 1 0    0 1 1 1    0 0 0 0
%e A183366   0 0 1 0    1 0 0 0    1 1 1 0    0 1 1 1    1 0 0 1
%Y A183366 Column 4 of A183368.
%K A183366 nonn
%O A183366 1,1
%A A183366 _R. H. Hardin_, Jan 04 2011