Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A070053
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A070053 Number of Bottleneck-Monge matrices with 5 rows. In the formula below, P=5. +0
6
32, 223, 1194, 5535, 23225, 90398, 331561, 1158554, 3887592 (list; graph; listen)
OFFSET

1,1

COMMENT

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]).

FORMULA

a(N, P) = 1 + sum(C(N, n)*C(P, p)*K(p, n)), n=1..N, p=1..P where : C is the binomial coefficient K(p, n) = sum(T(p, n, i)), i=1..n where : 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

CROSSREFS

Cf. A070050, A070051, A070052, A070054, A070055, A070056, A070057.

Adjacent sequences: A070050 A070051 A070052 this_sequence A070054 A070055 A070056

Sequence in context: A119286 A125342 A126500 this_sequence A022146 A060622 A118999

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research