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.

A268364 Number of (2n-1) X 3 arrays containing 3 copies of 0..2n-2 with row sums equal.

This page as a plain text file.
%I A268364 #6 Aug 12 2016 07:05:19
%S A268364 1,216,116640,535610880,3614668001280,89303801403801600,
%T A268364 2951593617355820236800
%N A268364 Number of (2n-1) X 3 arrays containing 3 copies of 0..2n-2 with row sums equal.
%C A268364 Column 3 of A268367 (odd terms)
%e A268364 Some solutions for n=3
%e A268364 ..0..4..2....1..2..3....0..3..3....2..3..1....3..2..1....2..3..1....1..2..3
%e A268364 ..3..0..3....1..4..1....2..4..0....0..2..4....1..1..4....4..1..1....0..4..2
%e A268364 ..1..2..3....3..3..0....4..0..2....1..1..4....3..3..0....3..0..3....0..2..4
%e A268364 ..0..2..4....2..0..4....4..1..1....0..4..2....2..0..4....0..2..4....1..4..1
%e A268364 ..4..1..1....0..4..2....2..3..1....3..3..0....0..2..4....2..4..0....3..3..0
%Y A268364 Cf. A268367.
%K A268364 nonn
%O A268364 1,2
%A A268364 _R. H. Hardin_, Feb 03 2016

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

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