login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A144088 T(n,k) is the number of partial bijections (or subpermutations) of an n-element set with exactly k fixed points. 4

%I #32 Sep 02 2023 02:26:31

%S 1,1,1,4,2,1,18,12,3,1,108,72,24,4,1,780,540,180,40,5,1,6600,4680,

%T 1620,360,60,6,1,63840,46200,16380,3780,630,84,7,1,693840,510720,

%U 184800,43680,7560,1008,112,8,1,8361360,6244560,2298240,554400,98280,13608,1512,144,9,1

%N T(n,k) is the number of partial bijections (or subpermutations) of an n-element set with exactly k fixed points.

%H Andrew Howroyd, <a href="/A144088/b144088.txt">Table of n, a(n) for n = 0..1325</a> (rows n = 0..50)

%H A. Laradji and A. Umar, <a href="http://dx.doi.org/10.1007/s00233-007-0732-8">Combinatorial results for the symmetric inverse semigroup</a>, Semigroup Forum 75, (2007), 221-236.

%H A. Umar, <a href="http://www.mathnet.ru/eng/adm33">Some combinatorial problems in the theory of symmetric ...</a>, Algebra Disc. Math. 9 (2010) 115-126.

%F T(n,k) = C(n,k)*(n-k)! * Sum_{m=0..n-k} (-1^m/m!)*Sum_{j=0..n-m} C(n-m,j)/j!.

%F (n-k)*T(n,k) = n*(2n-2k-1)*T(n-1,k) - n*(n-1)*(n-k-3)*T(n-2,k) - n*(n-1)*(n-2)*T(n-3,k), T(k,k)=1 and T(n,k)=0 if n < k.

%F E.g.f.: exp(log(1/(1-x)) - x + y*x)*exp(x/(1-x)). - _Geoffrey Critzer_, Nov 29 2021

%e Triangle begins:

%e 1;

%e 1, 1;

%e 4, 2, 1;

%e 18, 12, 3, 1;

%e 108, 72, 24, 4, 1;

%e 780, 540, 180, 40, 5, 1;

%e 6600, 4680, 1620, 360, 60, 6, 1;

%e 63840, 46200, 16380, 3780, 630, 84, 7, 1;

%e ...

%e T(3,1) = 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.

%t max = 7; f[x_, k_] := (x^k/k!)*(Exp[x^2/(1-x)]/(1-x)); t[n_, k_] := n!*SeriesCoefficient[ Series[ f[x, k], {x, 0, max}], n]; Flatten[ Table[ t[n, k], {n, 0, max}, {k, 0, n}]](* _Jean-François Alcover_, Mar 12 2012, from e.g.f. by _Joerg Arndt_ *)

%o (PARI)

%o T(n) = {my(egf=exp(log(1/(1-x) + O(x*x^n)) - x + y*x + x/(1-x))); Vec([Vecrev(p) | p<-Vec(serlaplace(egf))])}

%o { my(A=T(10)); for(n=1, #A, print(A[n])) } \\ _Andrew Howroyd_, Nov 29 2021

%Y T(n, 0) = A144085, T(n, 1) = A144086, T(n, 2) = A144087.

%Y Row sums give A002720.

%K nice,nonn,tabl

%O 0,4

%A _Abdullahi Umar_, Sep 11 2008, Sep 16 2008

%E Terms a(36) and beyond from _Andrew Howroyd_, Nov 29 2021

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 14:23 EDT 2024. Contains 371960 sequences. (Running on oeis4.)