login
Number of nX6 0..1 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other
1

%I #5 Mar 31 2012 12:36:57

%S 12,90,492,34648,951900,8752012,835055180,26168432516,263920060072,

%T 26695956060220,877185284072810,9205722917009728,957006277742591952,

%U 32215399397427414524,345575050380580295848,36502877769482372316804

%N Number of nX6 0..1 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other

%C Column 6 of A203638

%H R. H. Hardin, <a href="/A203636/b203636.txt">Table of n, a(n) for n = 1..20</a>

%e Some solutions for n=4

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 04 2012