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.

A268205 Number of 1Xn 0..n arrays with every repeated value in every row and column greater than the previous repeated value.

This page as a plain text file.
%I A268205 #4 Jan 28 2016 16:04:44
%S A268205 2,9,60,570,6960,104006,1837752,37478718,866361210,22384298772,
%T A268205 639235846656,19993319047663,679693673292816,24954856965472485,
%U A268205 984056034148827632,41479800266522142954,1861205533117885580022
%N A268205 Number of 1Xn 0..n arrays with every repeated value in every row and column greater than the previous repeated value.
%C A268205 Row 1 of A268204.
%H A268205 R. H. Hardin, <a href="/A268205/b268205.txt">Table of n, a(n) for n = 1..193</a>
%e A268205 Some solutions for n=6
%e A268205 ..4..1..5..1..3..3....4..2..6..4..4..0....5..0..0..6..5..0....3..1..2..6..1..3
%Y A268205 Cf. A268204.
%K A268205 nonn
%O A268205 1,1
%A A268205 _R. H. Hardin_, Jan 28 2016