The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #5 Nov 25 2013 07:58:30
%S 4,4,2,8,10,2,22,36,2,94,158,2,464,804,2,2468,4356,2,13740,24538,2,
%T 79006,142346,2,465374,844154,2,2793340,5094494,2,17024342,31187522,2,
%U 105069752,193197732,2,655339708,1208811268,2,4124342730,7628174840,2
%N Number of (n+1)X(1+1) 0..3 arrays x(i,j) with every row sum{j*x(i,j), j=1..1+1} equal, and every column sum{i*x(i,j), i=1..n+1} equal, with top left element <= 1
%C Column 1 of A232526
%H R. H. Hardin, <a href="/A232523/b232523.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=7
%e ..1..2....0..1....1..3....0..2....0..1....0..2....0..1....0..1....1..2....0..2
%e ..1..2....2..0....3..2....0..2....2..0....2..1....0..1....0..1....3..1....2..1
%e ..1..2....0..1....3..2....2..1....2..0....0..2....0..1....2..0....3..1....2..1
%e ..1..2....2..0....3..2....0..2....0..1....2..1....2..0....2..0....1..2....2..1
%e ..3..1....0..1....1..3....0..2....0..1....2..1....0..1....2..0....1..2....0..2
%e ..1..2....2..0....1..3....2..1....0..1....2..1....0..1....0..1....1..2....0..2
%e ..3..1....0..1....3..2....2..1....2..0....2..1....0..1....0..1....3..1....2..1
%e ..1..2....0..1....3..2....2..1....0..1....0..2....2..0....0..1....1..2....2..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 25 2013