cp's OEIS Frontend

A362967 Number of nondecreasing partitions of n^2 into n parts from the intervals [1,n], [2,n+1], ..., [n,2n-1], respectively.

%I A362967 #12 Jun 18 2023 13:36:26
%S A362967 1,1,2,5,17,66,294,1393,6965,36111,192850,1053894,5871306,33234990,
%T A362967 190704140,1107086841,6492325565,38412063755,229052915708,
%U A362967 1375396927729,8310509070747,50496841617102,308394124109340,1892137615326526,11658149626059204,72108088307308032,447590893613564372
%N A362967 Number of nondecreasing partitions of n^2 into n parts from the intervals [1,n], [2,n+1], ..., [n,2n-1], respectively.
%C A362967 a(n) <= A039744(n); a(n) <= A077045(n); a(n) >= A019589(n).
%H A362967 Max Alekseyev, <a href="/A362967/b362967.txt">Table of n, a(n) for n = 0..100</a>
%o A362967 (Sage) def a362967(n): return Partitions(n^2, length=n, inner=range(n,0,-1), outer=range(2*n-1,n-1,-1)).cardinality()
%Y A362967 Cf. A019589, A039744, A077045.
%K A362967 nonn
%O A362967 0,3
%A A362967 _Max Alekseyev_, Jun 16 2023