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.

A268250 Number of 3Xn 0..n arrays with every repeated value in every row greater than, and every column greater than or equal to, the previous repeated value.

This page as a plain text file.
%I A268250 #3 Jan 29 2016 07:37:22
%S A268250 8,729,216000,185193000,337153536000,1125058699232216,
%T A268250 6206699397581803008,52644642506757331562232,
%U A268250 650274909835389362799561000,11215805818364638436336901795648
%N A268250 Number of 3Xn 0..n arrays with every repeated value in every row greater than, and every column greater than or equal to, the previous repeated value.
%C A268250 Row 3 of A268249.
%e A268250 Some solutions for n=2
%e A268250 ..0..1....1..1....0..0....2..0....0..0....2..2....2..1....1..1....0..2....0..1
%e A268250 ..1..0....1..1....0..0....0..2....0..1....1..0....1..1....2..0....0..2....0..1
%e A268250 ..1..1....0..0....1..1....0..0....1..2....1..0....1..2....1..0....2..1....1..2
%Y A268250 Cf. A268249.
%K A268250 nonn
%O A268250 1,1
%A A268250 _R. H. Hardin_, Jan 29 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.