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(8, N), where a(P, N) is defined recursively in A070050.
G.f.: x*(256 - 4609*x + 40669*x^2 - 232695*x^3 + 961183*x^4 - 3017869*x^5 + 7388387*x^6 - 14256058*x^7 + 21694227*x^8 - 25838259*x^9 + 23693517*x^10 - 16267523*x^11 + 7986763*x^12 - 2589705*x^13 + 474491*x^14 - 32768*x^15) / ((1 - x)*(1 - 2*x)^15) (conjectured). - Colin Barker, Sep 10 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
Pascal Prea (pascal.prea(AT)lim.univ-mrs.fr), Apr 18 2002
EXTENSIONS
a(10)-a(24) from Nathaniel Johnston, Apr 13 2011
STATUS
approved