login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of (n+2)X(6+2) 0..3 arrays with nondecreasing sum of every three consecutive values in every row and column
1

%I #4 Nov 28 2014 09:42:20

%S 64000000000,24500000000000,9378906250000000,3590362548828125000,

%T 394078193359375000000,43254022503125000000000,

%U 4747561509943000000000000,234491558099104656000000000,11582007037630977169152000000

%N Number of (n+2)X(6+2) 0..3 arrays with nondecreasing sum of every three consecutive values in every row and column

%C Column 6 of A250868

%H R. H. Hardin, <a href="/A250866/b250866.txt">Table of n, a(n) for n = 1..23</a>

%e Some solutions for n=1

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

%e ..0..0..0..0..0..0..2..2....0..0..0..0..0..0..2..2....0..0..0..0..2..0..2..3

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Nov 28 2014