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.

A183478 Number of nX4 0..2 arrays with every element equal to either the sum mod 3 of its vertical neighbors or the sum mod 3 of its horizontal neighbors.

This page as a plain text file.
%I A183478 #7 Jul 22 2025 08:59:14
%S A183478 7,135,587,4015,40073,270549,1942323,15984991,119888365,894632985,
%T A183478 6977123487,53362780811,405255680609,3117495042837,23903072796727,
%U A183478 182681815961381,1400954811635395,10740879929227211,82253911392409687
%N A183478 Number of nX4 0..2 arrays with every element equal to either the sum mod 3 of its vertical neighbors or the sum mod 3 of its horizontal neighbors.
%C A183478 Column 4 of A183483
%H A183478 R. H. Hardin, <a href="/A183478/b183478.txt">Table of n, a(n) for n = 1..200</a>
%e A183478 Some solutions for 6X4
%e A183478 ..0..0..0..0....0..0..1..1....0..0..0..0....0..2..1..0....0..0..0..0
%e A183478 ..2..2..0..2....1..0..1..1....1..2..0..0....0..2..1..0....0..0..1..1
%e A183478 ..0..0..0..2....1..0..0..0....1..2..0..0....0..0..0..0....0..0..1..1
%e A183478 ..0..0..0..0....0..0..0..0....0..0..0..0....0..0..1..1....0..0..0..0
%e A183478 ..0..0..0..2....2..1..2..2....0..0..0..2....0..0..0..0....1..1..0..1
%e A183478 ..1..1..0..2....2..1..2..2....2..2..0..2....1..1..0..0....1..1..0..1
%K A183478 nonn
%O A183478 1,1
%A A183478 _R. H. Hardin_ Jan 05 2011