|
%I #9 Feb 28 2013 09:04:02
%S 64,559,3558,19030,90398,393133,1595475,6121871,22418665,78909805,
%T 268421215,886226507,2849922043,8952215067,27534649147,83092274171,
%U 246448262139,719487237115,2070217930747,5877572837371,16481768407035,45689773670395,125310468063227,340264608595963,915344114450427,2440847110832123
%N Number of Bottleneck-Monge matrices with 6 rows.
%C Bottleneck-Monge matrices are {0,1} matrices A in which, for every i<j and k<l, max(A[i,l],A[j,k]) <= max(A[i,k],A[j,l]).
%H Nathaniel Johnston, <a href="/A070054/b070054.txt">Table of n, a(n) for n = 1..400</a>
%F a(N) = a(6, N), where a(P, N) is defined recursively in A070050.
%F Empirical G.f.: -x*(2048*x^11-21010*x^10+81464*x^9-175106*x^8+241444*x^7-229084*x^6+154777*x^5-75284*x^4+26086*x^3-6189*x^2+913*x-64) / ((x-1)*(2*x-1)^11). - _Colin Barker_, Feb 28 2013
%Y Cf. A070050, A070051, A070052, A070054, A070055, A070056, A070057.
%K nonn
%O 1,1
%A Pascal Prea (pascal.prea(AT)lim.univ-mrs.fr), Apr 18 2002
%E a(10) - a(26) from _Nathaniel Johnston_, Apr 13 2011
|
