login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 1

%I

%S 13,495,2925,40073,706473,7773025,107741253,1577932971,20728674493,

%T 287526589977,4036331530635,55313628172919,767230355186961,

%U 10669808831015745,147604547979187367,2047336009619708185

%N 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 Column 5 of A183483

%H R. H. Hardin, <a href="/A183479/b183479.txt">Table of n, a(n) for n = 1..131</a>

%e Some solutions for 4X5

%e ..1..1..0..1..1....1..0..0..0..0....1..1..0..0..0....2..2..0..1..1

%e ..0..0..0..0..0....1..0..0..2..2....2..0..0..0..2....0..0..0..0..0

%e ..0..2..1..0..1....0..0..0..0..0....1..2..0..0..2....1..2..2..2..0

%e ..0..2..1..0..1....0..0..2..2..0....2..2..0..0..0....1..2..2..2..0

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 05 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 21 12:54 EDT 2021. Contains 347598 sequences. (Running on oeis4.)