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.

A183479 Number of nX5 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 A183479 #7 Jul 22 2025 08:59:21
%S A183479 13,495,2925,40073,706473,7773025,107741253,1577932971,20728674493,
%T A183479 287526589977,4036331530635,55313628172919,767230355186961,
%U A183479 10669808831015745,147604547979187367,2047336009619708185
%N A183479 Number of nX5 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 A183479 Column 5 of A183483
%H A183479 R. H. Hardin, <a href="/A183479/b183479.txt">Table of n, a(n) for n = 1..131</a>
%e A183479 Some solutions for 4X5
%e A183479 ..1..1..0..1..1....1..0..0..0..0....1..1..0..0..0....2..2..0..1..1
%e A183479 ..0..0..0..0..0....1..0..0..2..2....2..0..0..0..2....0..0..0..0..0
%e A183479 ..0..2..1..0..1....0..0..0..0..0....1..2..0..0..2....1..2..2..2..0
%e A183479 ..0..2..1..0..1....0..0..2..2..0....2..2..0..0..0....1..2..2..2..0
%K A183479 nonn
%O A183479 1,1
%A A183479 _R. H. Hardin_ Jan 05 2011