Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A144086
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A144086 a(n) is the number of partial bijections (or subpermutations) of an n-element set with exactly 1 fixed point. +0
3
0, 1, 2, 12, 72, 540, 4680, 46200, 510720, 6244560, 83613600, 1216131840, 19084222080 (list; graph; listen)
OFFSET

0,3

REFERENCES

Laradji, A. and Umar, A. Combinatorial results for the symmetric inverse semigroup. Semigroup Forum 75, (2007), 221-236.

FORMULA

a(n)=n!*sum(m=0,n-1,(-1^m/m!)sum(j=0,n-m,C(n-m)/j!)); (n-1)a(n)=n(2n-3)a(n-1)-n(n-1)(n-4)a(n-2)-n(n-1)(n-2)a(n-3), a(1)=1 and a(n)= 0 if n<1

EXAMPLE

a(3) = 12 because there are exactly 12 partial bijections (on a 3-element set) with exactly 1 fixed point, namely: (1)->(1), (2)->(2), (3)->(3), (1,2)->(1,3), (1,2)->(3,2), (1,3)->(1,2), (1,3)->(2,3), (2,3)->(2,1), (2,3)->(1,3), (1,2,3)->(1,3,2), (1,2,3)->(3,2,1), (1,2,3)->(2,1,3) - the mappings are coordinate-wise.

CROSSREFS

a(n) = A144088(n, 1) and a(n) = n*A144085(n-1)

Sequence in context: A062119 A052556 A052833 this_sequence A005443 A002867 A130426

Adjacent sequences: A144083 A144084 A144085 this_sequence A144087 A144088 A144089

KEYWORD

nonn

AUTHOR

A. Umar (aumarh(AT)squ.edu.om), Sep 10 2008, Sep 15 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research