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.

A265119 Number of 4Xn arrays containing n copies of 0..4-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 A265119 #5 Aug 12 2016 06:53:58
%S A265119 0,0,0,624,0,10110,0,300744,0,12012024,0,606876964,0,33691227158,0,
%T A265119 1960112974014,0
%N A265119 Number of 4Xn arrays containing n copies of 0..4-1 with row sums equal, column sums equal and full-length antidiagonal sums equal to the short dimension sums.
%C A265119 Row 4 of A265117.
%e A265119 Some solutions for n=6
%e A265119 ..1..2..0..2..3..1....0..3..2..0..3..1....0..1..2..0..3..3....0..1..2..0..3..3
%e A265119 ..2..1..1..1..2..2....0..2..3..1..2..1....1..3..2..2..1..0....1..2..3..1..0..2
%e A265119 ..3..3..2..0..1..0....3..0..1..3..0..2....3..2..1..1..2..0....3..1..0..2..3..0
%e A265119 ..0..0..3..3..0..3....3..1..0..2..1..2....2..0..1..3..0..3....2..2..1..3..0..1
%Y A265119 Cf. A265117.
%K A265119 nonn
%O A265119 1,4
%A A265119 _R. H. Hardin_, Dec 01 2015

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.