OFFSET
1,2
COMMENTS
The condition that the rows be in nonincreasing order is equivalent to considering nonequivalent matrices up to permutation of rows.
a(n) is the number of T_0 n-regular set multipartitions (multisets of sets) on a 3-set.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (4,-5,0,5,-4,1).
FORMULA
a(n) = round(((n+2)/2)^4) - 3*(n+1) + 2.
G.f.: x*(1 + 5*x - 2*x^2 - 3*x^3 + 2*x^4)/((1 - x)^5*(1 + x)). - Andrew Howroyd, Nov 14 2025
E.g.f.: (x*(17 + 55*x + 14*x^2 + x^3)*cosh(x) - (1 - 17*x - 55*x^2 - 14*x^3 - x^4)*sinh(x))/16. - Stefano Spezia, Nov 15 2025
EXAMPLE
The a(2) = 9 matrices are:
[1, 0, 0] [1, 1, 0] [1, 0, 1] [1, 0, 0]
[1, 0, 0] [1, 0, 0] [1, 0, 0] [1, 0, 0]
[0, 1, 0] [0, 1, 0] [0, 1, 0] [0, 1, 1]
[0, 1, 0] [0, 0, 1] [0, 1, 0] [0, 1, 0]
[0, 0, 1] [0, 0, 1] [0, 0, 1] [0, 0, 1]
[0, 0, 1]
.
[1, 1, 1] [1, 1, 0] [1, 1, 0] [1, 0, 1] [1, 1, 0]
[1, 0, 0] [1, 0, 1] [1, 0, 0] [1, 0, 0] [1, 0, 1]
[0, 1, 0] [0, 1, 0] [0, 1, 1] [0, 1, 1] [0, 1, 1]
[0, 0, 1] [0, 0, 1] [0, 0, 1] [0, 1, 0]
MATHEMATICA
LinearRecurrence[{4, -5, 0, 5, -4, 1}, {1, 9, 29, 68, 134, 237}, 50] (* Paolo Xausa, Nov 14 2025 *)
PROG
(PARI) a(n) = {round(((n+2)/2)^4) - 3*(n+1) + 2}
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Andrew Howroyd, Jan 15 2020
STATUS
approved
