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.
%I A331390 #11 Dec 23 2020 01:50:50
%S A331390 1,9,29,68,134,237,388,600,887,1265,1751,2364,3124,4053,5174,6512,
%T A331390 8093,9945,12097,14580,17426,20669,24344,28488,33139,38337,44123,
%U A331390 50540,57632,65445,74026,83424,93689,104873,117029,130212,144478,159885,176492,194360,213551
%N A331390 Number of binary matrices with 3 distinct columns and any number of nonzero rows with n ones in every column and rows in nonincreasing lexicographic order.
%C A331390 The condition that the rows be in nonincreasing order is equivalent to considering nonequivalent matrices up to permutation of rows.
%C A331390 a(n) is the number of T_0 n-regular set multipartitions (multisets of sets) on a 3-set.
%H A331390 Andrew Howroyd, <a href="/A331390/b331390.txt">Table of n, a(n) for n = 1..1000</a>
%F A331390 a(n) = round(((n+2)/2)^4) - 3*(n+1) + 2.
%e A331390 The a(2) = 9 matrices are:
%e A331390 [1, 0, 0] [1, 1, 0] [1, 0, 1] [1, 0, 0]
%e A331390 [1, 0, 0] [1, 0, 0] [1, 0, 0] [1, 0, 0]
%e A331390 [0, 1, 0] [0, 1, 0] [0, 1, 0] [0, 1, 1]
%e A331390 [0, 1, 0] [0, 0, 1] [0, 1, 0] [0, 1, 0]
%e A331390 [0, 0, 1] [0, 0, 1] [0, 0, 1] [0, 0, 1]
%e A331390 [0, 0, 1]
%e A331390 .
%e A331390 [1, 1, 1] [1, 1, 0] [1, 1, 0] [1, 0, 1] [1, 1, 0]
%e A331390 [1, 0, 0] [1, 0, 1] [1, 0, 0] [1, 0, 0] [1, 0, 1]
%e A331390 [0, 1, 0] [0, 1, 0] [0, 1, 1] [0, 1, 1] [0, 1, 1]
%e A331390 [0, 0, 1] [0, 0, 1] [0, 0, 1] [0, 1, 0]
%o A331390 (PARI) a(n) = {round(((n+2)/2)^4) - 3*(n+1) + 2}
%Y A331390 Column k=3 of A331126.
%K A331390 nonn
%O A331390 1,2
%A A331390 _Andrew Howroyd_, Jan 15 2020