Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A145034
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A145034 T(n,k) is the number of order-decreasing and order-preserving partial transformations (of an n-chain) of width (width(alpha) = |Dom(alpha)|) and waist (waist(alpha) = max(Im(alpha))) both equal to k. +0
1
1, 1, 1, 1, 2, 1, 3, 4, 2, 1, 4, 9, 12, 5, 1, 5, 16, 36, 40, 14, 1, 6, 25, 80, 150, 140, 42, 1, 7, 36, 150, 400, 630, 504, 132 (list; table; graph; listen)
OFFSET

0,5

REFERENCES

Laradji, A. and Umar, A. Combinatorial results for semigroups of order-decreasing partial transformations. J. Integer Seq. 7, (2004), 04.3.8, 14 pp.

LINKS

Laradji, A. and Umar, A. Combinatorial Results for Semigroups of Order-Decreasing Partial Transformations , Journal of Integer Sequences, Vol. 7 (2004), Article 04.3.8. [From A. Umar (aumarh(AT)squ.edu.om), Oct 07 2008]

FORMULA

T(n,k)=C(n,k)C(2k-2,k-1)(n-k+1)/n, (n>=k>=1), T(n,0)=1

EXAMPLE

T(3,2) = 4 because there are exactly 4 order-decreasing and order-preserving partial transformations (of a 3-chain) of width and waist both equal to 2, namely: (1,2)->(1,2), (1,3)->(1,2), (2,3)->(1,2), (2,3)->(2,2).

CROSSREFS

Sequence in context: A106382 A004741 A133923 this_sequence A125158 A112384 A123390

Adjacent sequences: A145031 A145032 A145033 this_sequence A145035 A145036 A145037

KEYWORD

nonn,tabl

AUTHOR

A. Umar (aumarh(AT)squ.edu.om), Sep 30 2008

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research