OFFSET
1,1
COMMENTS
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]).
LINKS
Nathaniel Johnston, Table of n, a(n) for n = 1..400
FORMULA
a(N) = a(3, N), where a(P, N) is defined recursively in A070050.
Empirical G.f.: -x*(32*x^5-140*x^4+213*x^3-154*x^2+55*x-8) / ((x-1)*(2*x-1)^5). - Colin Barker, Feb 28 2013
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Pascal Prea (pascal.prea(AT)lim.univ-mrs.fr), Apr 18 2002
EXTENSIONS
a(10) - a(27) from Nathaniel Johnston, Apr 13 2011
STATUS
approved