cp's OEIS Frontend

A268367 T(n,k) = Number of n X k arrays containing k copies of 0..n-1 with row sums equal.

%I A268367 #8 Aug 12 2016 06:55:35
%S A268367 1,1,0,1,4,0,1,0,12,0,1,36,216,96,0,1,0,2700,0,480,0,1,400,54000,
%T A268367 643680,116640,5760,0,1,0,1054200,0,190188000,0,40320,0,1,4900,
%U A268367 20991600,12243840000,269568000000,128247235200,535610880,645120,0,1,0,445365900
%N A268367 T(n,k) = Number of n X k arrays containing k copies of 0..n-1 with row sums equal.
%C A268367 Table starts
%C A268367 .1.......1.........1...............1............1...............1........1
%C A268367 .0.......4.........0..............36............0.............400........0
%C A268367 .0......12.......216............2700........54000.........1054200.20991600
%C A268367 .0......96.........0..........643680............0.....12243840000........0
%C A268367 .0.....480....116640.......190188000.269568000000.429355384500000
%C A268367 .0....5760.........0....128247235200............0
%C A268367 .0...40320.535610880.114921318153600
%C A268367 .0..645120.........0
%C A268367 .0.5806080
%C A268367 .0
%H A268367 R. H. Hardin, <a href="/A268367/b268367.txt">Table of n, a(n) for n = 1..59</a>
%e A268367 Some solutions for n=3 k=4
%e A268367 ..1..0..2..1....0..2..1..1....0..1..2..1....2..1..1..0....1..0..2..1
%e A268367 ..0..0..2..2....1..1..2..0....2..1..0..1....2..0..1..1....0..2..0..2
%e A268367 ..1..2..0..1....0..0..2..2....2..2..0..0....0..2..0..2....0..2..1..1
%K A268367 nonn,tabl
%O A268367 1,5
%A A268367 _R. H. Hardin_, Feb 03 2016