cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A265117 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with row sums equal, column sums equal and full-length antidiagonal sums equal to the short dimension sums.

This page as a plain text file.
%I A265117 #5 Aug 12 2016 06:55:34
%S A265117 1,1,0,1,0,0,1,0,0,0,1,0,8,0,0,1,0,6,0,0,0,1,0,10,624,16,0,0,1,0,26,0,
%T A265117 6592,0,0,0,1,0,42,10110,8140944,126764,168,0,0,1,0,70,0,195568740,0,
%U A265117 3493730,0,0,0,1,0,150,300744
%N A265117 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with row sums equal, column sums equal and full-length antidiagonal sums equal to the short dimension sums.
%C A265117 Table starts
%C A265117 .1.1...1.......1.......1.........1..1......1...1.1.1
%C A265117 .0.0...0.......0.......0.........0..0......0...0.0
%C A265117 .0.0...8.......6......10........26.42.....70.150
%C A265117 .0.0...0.....624.......0.....10110..0.300744
%C A265117 .0.0..16....6592.8140944.195568740
%C A265117 .0.0...0..126764.......0
%C A265117 .0.0.168.3493730
%C A265117 .0.0...0
%C A265117 .0.0
%C A265117 .0
%e A265117 Some solutions for n=4 k=4
%e A265117 ..3..1..2..0....1..3..2..0....1..3..2..0....3..3..0..0....1..0..3..2
%e A265117 ..1..0..3..2....3..0..2..1....2..0..1..3....0..0..3..3....3..2..1..0
%e A265117 ..2..3..0..1....1..3..0..2....0..2..1..3....1..1..2..2....0..1..2..3
%e A265117 ..0..2..1..3....1..0..2..3....3..1..2..0....2..2..1..1....2..3..0..1
%K A265117 nonn,tabl
%O A265117 1,13
%A A265117 _R. H. Hardin_, Dec 01 2015