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.

A183481 Number of nX7 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 A183481 #6 Jul 22 2025 08:59:36
%S A183481 37,5751,58333,1942323,107741253,2519745049,84056287173
%N A183481 Number of nX7 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 A183481 Column 7 of A183483
%e A183481 Some solutions for 4X7
%e A183481 ..0..0..0..1..1..0..2....0..0..0..0..2..1..0....0..0..1..0..2..2..0
%e A183481 ..0..0..0..1..0..0..2....0..0..0..0..2..1..0....0..0..1..0..0..0..0
%e A183481 ..0..1..0..0..2..0..0....0..0..0..0..0..0..0....0..0..0..0..1..0..0
%e A183481 ..0..1..0..2..2..0..0....0..0..0..0..0..2..2....0..1..1..0..1..0..0
%K A183481 nonn
%O A183481 1,1
%A A183481 _R. H. Hardin_ Jan 05 2011