1,1

A bottleneck-Monge matrix is a {0,1} matrix A in which, for every i<j and k<l, max(A[i,l],A[j,k]) <= max(A[i,k], A[j,l]).

a(P, N) = sum (C(N, n) * C(P, p) * K(p, n)), n=0 .. N, p=0 .. P, where C(i, j) = binomial coefficient, K(p, n) = sum (T(p, n, i)), i=1 .. n, T(1, n, 1) = 1, T(1, n, i) = 0, for i>1 T(p, n, i) = sum(K(p-1, j)), j=i .. n.

Sequence in context: A001665 A066536 A104747 this_sequence A027941 A135254 A000754

Adjacent sequences: A070047 A070048 A070049 this_sequence A070051 A070052 A070053

nonn,easy,more

Pascal Prea (pascal.preq(AT)lim.univ-mrs.fr), Apr 18 2002