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 A140935 #11 Jan 25 2025 12:15:43
%S A140935 1,364,41405,2318680,78835120,1837984512,31803696288,431621592480,
%T A140935 4783805983320,44648855844320,359423289546776,2543610972177184,
%U A140935 16072267131888800,91841526467936000,479707973069130000,2311063705550691000,10348807328532138375
%N A140935 Number of 3 X 11 matrices with elements in 0..n with each row and each column in nondecreasing order.
%C A140935 In the definition, 3,11,n can be permuted, see formula.
%H A140935 Feihu Liu, Guoce Xin, and Chen Zhang, <a href="https://arxiv.org/abs/2412.18744">Ehrhart Polynomials of Order Polytopes: Interpreting Combinatorial Sequences on the OEIS</a>, arXiv:2412.18744 [math.CO], 2024. See p. 25.
%F A140935 (Empirical) set p,q,r to n,11,3 (in any order) in s=p+q+r-1; a(n) = product {i in 0..r-1} (binomial(s,p+i)*i!/(s-i)^(r-i-1))
%K A140935 nonn
%O A140935 0,2
%A A140935 _R. H. Hardin_, Jul 05 2008
%E A140935 Edited by _N. J. A. Sloane_, Aug 28 2010 and May 08 2012