login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A253163 Number of (n+1)X(5+1) 0..2 arrays with every 2X2 subblock sum differing from its neighbors horizontally, vertically and nw-se diagonally 1

%I #4 Dec 28 2014 08:24:14

%S 186624,4189216,92998506,2461955138,62954425188,1612778665632,

%T 40892835737758,1045243631714532,26655995880836874,680590803725411114,

%U 17356137926136738110,442903594404834251862,11300064205772118129666

%N Number of (n+1)X(5+1) 0..2 arrays with every 2X2 subblock sum differing from its neighbors horizontally, vertically and nw-se diagonally

%C Column 5 of A253164

%H R. H. Hardin, <a href="/A253163/b253163.txt">Table of n, a(n) for n = 1..35</a>

%e Some solutions for n=1

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 28 2014

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 17 05:50 EDT 2024. Contains 374360 sequences. (Running on oeis4.)